--- _id: '2129' abstract: - lang: eng text: "This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. \n\n\n" acknowledgement: JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). author: - first_name: Nicola full_name: Gigli, Nicola last_name: Gigli - first_name: Jan full_name: Jan Maas id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: Gigli N, Maas J. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 2013;45(2):879-899. doi:10.1137/120886315 apa: Gigli, N., & Maas, J. (2013). Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120886315 chicago: Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120886315 . ieee: N. Gigli and J. Maas, “Gromov-Hausdorff convergence of discrete transportation metrics,” SIAM Journal on Mathematical Analysis, vol. 45, no. 2. Society for Industrial and Applied Mathematics , pp. 879–899, 2013. ista: Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899. mla: Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” SIAM Journal on Mathematical Analysis, vol. 45, no. 2, Society for Industrial and Applied Mathematics , 2013, pp. 879–99, doi:10.1137/120886315 . short: N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899. date_created: 2018-12-11T11:55:53Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:55:29Z day: '01' doi: '10.1137/120886315 ' extern: 1 intvolume: ' 45' issue: '2' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1207.6501 month: '01' oa: 1 page: 879 - 899 publication: SIAM Journal on Mathematical Analysis publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '4904' quality_controlled: 0 status: public title: Gromov-Hausdorff convergence of discrete transportation metrics type: journal_article volume: 45 year: '2013' ... --- _id: '2139' abstract: - lang: eng text: Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms. acknowledgement: The work was supported by the NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory author: - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 citation: ama: Lemeshko M. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 2013;1(17). doi:10.3389/fphy.2013.00017 apa: Lemeshko, M. (2013). Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. Frontiers Media. https://doi.org/10.3389/fphy.2013.00017 chicago: Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics. Frontiers Media, 2013. https://doi.org/10.3389/fphy.2013.00017. ieee: M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” Frontiers Physics, vol. 1, no. 17. Frontiers Media, 2013. ista: Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17). mla: Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics, vol. 1, no. 17, Frontiers Media, 2013, doi:10.3389/fphy.2013.00017. short: M. Lemeshko, Frontiers Physics 1 (2013). date_created: 2018-12-11T11:55:56Z date_published: 2013-10-07T00:00:00Z date_updated: 2021-01-12T06:55:32Z day: '07' doi: 10.3389/fphy.2013.00017 extern: 1 intvolume: ' 1' issue: '17' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1307.8129 month: '10' oa: 1 publication: Frontiers Physics publication_status: published publisher: Frontiers Media publist_id: '4885' quality_controlled: 0 status: public title: Manipulating scattering of ultracold atoms with light-induced dissipation type: journal_article volume: 1 year: '2013' ... --- _id: '2181' abstract: - lang: eng text: 'There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all "legal" sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.' acknowledgement: ' and an Elise Richter Fellowship (Austrian Science Fund V00125). ' 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: Christoph full_name: Kirsch, Christoph last_name: Kirsch - first_name: Hannes full_name: Payer, Hannes last_name: Payer - first_name: Ali full_name: Sezgin, Ali id: 4C7638DA-F248-11E8-B48F-1D18A9856A87 last_name: Sezgin - first_name: Ana full_name: Sokolova, Ana last_name: Sokolova citation: ama: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109' apa: 'Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109' chicago: Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109. ieee: T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328. ista: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.' mla: Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109. short: T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328. conference: end_date: 2013-01-25 location: Rome, Italy name: 'POPL: Principles of Programming Languages' start_date: 2013-01-23 date_created: 2018-12-11T11:56:11Z date_published: 2013-01-01T00:00:00Z date_updated: 2023-02-21T16:06:49Z day: '01' ddc: - '000' - '004' department: - _id: ToHe doi: 10.1145/2429069.2429109 ec_funded: 1 file: - access_level: open_access checksum: adf465e70948f4e80e48057524516456 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:33Z date_updated: 2020-07-14T12:45:31Z file_id: '5086' file_name: IST-2014-198-v1+1_popl128-henzinger-clean.pdf file_size: 294689 relation: main_file file_date_updated: 2020-07-14T12:45:31Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 317 - 328 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: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language publication_identifier: isbn: - 978-1-4503-1832-7 publication_status: published publisher: ACM publist_id: '4801' pubrep_id: '198' quality_controlled: '1' related_material: record: - id: '10901' relation: later_version status: deleted scopus_import: 1 status: public title: Quantitative relaxation of concurrent data structures type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2182' abstract: - lang: eng text: We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed. author: - first_name: Pavol full_name: Cerny, Pavol id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87 last_name: Cerny - 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 citation: ama: 'Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085' apa: 'Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085' chicago: Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085. ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128. ista: 'Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.' mla: Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085. short: P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128. conference: end_date: 2013-01-25 location: Rome, Italy name: 'POPL: Principles of Programming Languages' start_date: 2013-07-23 date_created: 2018-12-11T11:56:11Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:55:50Z day: '01' department: - _id: ToHe doi: 10.1145/2429069.2429085 ec_funded: 1 language: - iso: eng month: '01' oa_version: None page: 115 - 128 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: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language publication_status: published publisher: ACM publist_id: '4800' quality_controlled: '1' scopus_import: 1 status: public title: Quantitative abstraction refinement type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2209' abstract: - lang: eng text: "A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n" alternative_title: - '2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) ' author: - first_name: Therese full_name: Biedl, Therese last_name: Biedl - first_name: Martin full_name: Held, Martin last_name: Held - first_name: Stefan full_name: Huber, Stefan id: 4700A070-F248-11E8-B48F-1D18A9856A87 last_name: Huber orcid: 0000-0002-8871-5814 citation: ama: 'Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11' apa: 'Biedl, T., Held, M., & Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. https://doi.org/10.1109/ISVD.2013.11' chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11. ieee: 'T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.' ista: 'Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.' mla: Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11. short: T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46. conference: end_date: 2013-07-10 location: St. Petersburg, Russia name: 'ISVD: Voronoi Diagrams in Science and Engineering' start_date: 2013-07-08 date_created: 2018-12-11T11:56:20Z date_published: 2013-12-01T00:00:00Z date_updated: 2021-01-12T06:56:00Z day: '01' department: - _id: HeEd doi: 10.1109/ISVD.2013.11 language: - iso: eng month: '12' oa_version: None page: 37 - 46 publication_identifier: eisbn: - '978-0-7695-5037-4 ' publication_status: published publisher: IEEE publist_id: '4763' quality_controlled: '1' scopus_import: 1 status: public title: Recognizing straight skeletons and Voronoi diagrams and reconstructing their input type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2204' abstract: - lang: eng text: We introduce a new platform for quantum simulation of many-body systems based on nonspherical atoms or molecules with zero dipole moments but possessing a significant value of electric quadrupole moments. We consider a quadrupolar Fermi gas trapped in a 2D square optical lattice, and show that the peculiar symmetry and broad tunability of the quadrupole-quadrupole interaction results in a rich phase diagram encompassing unconventional BCS and charge density wave phases, and opens up a perspective to create a topological superfluid. Quadrupolar species, such as metastable alkaline-earth atoms and homonuclear molecules, are stable against chemical reactions and collapse and are readily available in experiment at high densities. article_processing_charge: No author: - first_name: Satyan full_name: Bhongale, Satyan last_name: Bhongale - first_name: Ludwig full_name: Mathey, Ludwig last_name: Mathey - first_name: Erhai full_name: Zhao, Erhai last_name: Zhao - first_name: Susanne full_name: Yelin, Susanne last_name: Yelin - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 citation: ama: Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 2013;110(15). doi:10.1103/PhysRevLett.110.155301 apa: Bhongale, S., Mathey, L., Zhao, E., Yelin, S., & Lemeshko, M. (2013). Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.155301 chicago: Bhongale, Satyan, Ludwig Mathey, Erhai Zhao, Susanne Yelin, and Mikhail Lemeshko. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.155301. ieee: S. Bhongale, L. Mathey, E. Zhao, S. Yelin, and M. Lemeshko, “Quantum phases of quadrupolar fermi gases in optical lattices,” Physical Review Letters, vol. 110, no. 15. American Physical Society, 2013. ista: Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. 2013. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 110(15). mla: Bhongale, Satyan, et al. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters, vol. 110, no. 15, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.155301. short: S. Bhongale, L. Mathey, E. Zhao, S. Yelin, M. Lemeshko, Physical Review Letters 110 (2013). date_created: 2018-12-11T11:56:18Z date_published: 2013-04-08T00:00:00Z date_updated: 2021-11-16T08:04:06Z day: '08' doi: 10.1103/PhysRevLett.110.155301 extern: '1' intvolume: ' 110' issue: '15' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1211.3317 month: '04' oa: 1 oa_version: None publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '4769' related_material: link: - relation: erratum url: https://doi.org/10.1103/PhysRevLett.111.239901 status: public title: Quantum phases of quadrupolar fermi gases in optical lattices type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 110 year: '2013' ... --- _id: '2206' abstract: - lang: eng text: Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHoxY1-xF4. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases. author: - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Norman full_name: Yao, Norman Y last_name: Yao - first_name: Alexey full_name: Gorshkov, Alexey V last_name: Gorshkov - first_name: Hendrik full_name: Weimer, Hendrik last_name: Weimer - first_name: Steven full_name: Bennett, Steven D last_name: Bennett - first_name: Takamasa full_name: Momose, Takamasa last_name: Momose - first_name: Sarang full_name: Gopalakrishnan, Sarang last_name: Gopalakrishnan citation: ama: Lemeshko M, Yao N, Gorshkov A, et al. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 2013;88(1). doi:10.1103/PhysRevB.88.014426 apa: Lemeshko, M., Yao, N., Gorshkov, A., Weimer, H., Bennett, S., Momose, T., & Gopalakrishnan, S. (2013). Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.88.014426 chicago: Lemeshko, Mikhail, Norman Yao, Alexey Gorshkov, Hendrik Weimer, Steven Bennett, Takamasa Momose, and Sarang Gopalakrishnan. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.014426. ieee: M. Lemeshko et al., “Controllable quantum spin glasses with magnetic impurities embedded in quantum solids,” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1. American Physical Society, 2013. ista: Lemeshko M, Yao N, Gorshkov A, Weimer H, Bennett S, Momose T, Gopalakrishnan S. 2013. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 88(1). mla: Lemeshko, Mikhail, et al. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1, American Physical Society, 2013, doi:10.1103/PhysRevB.88.014426. short: M. Lemeshko, N. Yao, A. Gorshkov, H. Weimer, S. Bennett, T. Momose, S. Gopalakrishnan, Physical Review B - Condensed Matter and Materials Physics 88 (2013). date_created: 2018-12-11T11:56:19Z date_published: 2013-07-24T00:00:00Z date_updated: 2021-01-12T06:55:59Z day: '24' doi: 10.1103/PhysRevB.88.014426 extern: 1 intvolume: ' 88' issue: '1' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1307.1130 month: '07' oa: 1 publication: Physical Review B - Condensed Matter and Materials Physics publication_status: published publisher: American Physical Society publist_id: '4767' quality_controlled: 0 status: public title: Controllable quantum spin glasses with magnetic impurities embedded in quantum solids type: journal_article volume: 88 year: '2013' ... --- _id: '2205' abstract: - lang: eng text: The goal of the present article is to review the major developments that have led to the current understanding of molecule-field interactions and experimental methods for manipulating molecules with electromagnetic fields. Molecule-field interactions are at the core of several, seemingly distinct areas of molecular physics. This is reflected in the organisation of this article, which includes sections on field control of molecular beams, external field traps for cold molecules, control of molecular orientation and molecular alignment, manipulation of molecules by non-conservative forces, ultracold molecules and ultracold chemistry, controlled many-body phenomena, entanglement of molecules and dipole arrays, and stability of molecular systems in high-frequency super-intense laser fields. The article contains 852 references. acknowledgement: National Science Foundation; Natural Sciences and Engineering Research Council of Canada author: - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Roman full_name: Krems, Roman V last_name: Krems - first_name: John full_name: Doyle, John M last_name: Doyle - first_name: Sabre full_name: Kais, Sabre last_name: Kais citation: ama: Lemeshko M, Krems R, Doyle J, Kais S. Manipulation of molecules with electromagnetic fields. Molecular Physics. 2013;111(12-13):1648-1682. doi:10.1080/00268976.2013.813595 apa: Lemeshko, M., Krems, R., Doyle, J., & Kais, S. (2013). Manipulation of molecules with electromagnetic fields. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2013.813595 chicago: Lemeshko, Mikhail, Roman Krems, John Doyle, and Sabre Kais. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics. Taylor & Francis, 2013. https://doi.org/10.1080/00268976.2013.813595. ieee: M. Lemeshko, R. Krems, J. Doyle, and S. Kais, “Manipulation of molecules with electromagnetic fields,” Molecular Physics, vol. 111, no. 12–13. Taylor & Francis, pp. 1648–1682, 2013. ista: Lemeshko M, Krems R, Doyle J, Kais S. 2013. Manipulation of molecules with electromagnetic fields. Molecular Physics. 111(12–13), 1648–1682. mla: Lemeshko, Mikhail, et al. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics, vol. 111, no. 12–13, Taylor & Francis, 2013, pp. 1648–82, doi:10.1080/00268976.2013.813595. short: M. Lemeshko, R. Krems, J. Doyle, S. Kais, Molecular Physics 111 (2013) 1648–1682. date_created: 2018-12-11T11:56:19Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-07-14T12:45:32Z day: '01' doi: 10.1080/00268976.2013.813595 extern: 1 intvolume: ' 111' issue: 12-13 main_file_link: - open_access: '1' url: http://arxiv.org/abs/1306.0912 month: '07' oa: 1 page: 1648 - 1682 publication: Molecular Physics publication_status: published publisher: Taylor & Francis publist_id: '4768' quality_controlled: 0 status: public title: Manipulation of molecules with electromagnetic fields type: review volume: 111 year: '2013' ... --- _id: '2207' abstract: - lang: eng text: The formation of molecules and supramolecular structures results from bonding by conservative forces acting among electrons and nuclei and giving rise to equilibrium configurations defined by minima of the interaction potential. Here we show that bonding can also occur by the non-conservative forces responsible for interaction-induced coherent population trapping. The bound state arises in a dissipative process and manifests itself as a stationary state at a preordained interatomic distance. Remarkably, such a dissipative bonding is present even when the interactions among the atoms are purely repulsive. The dissipative bound states can be created and studied spectroscopically in present-day experiments with ultracold atoms or molecules and can potentially serve for cooling strongly interacting quantum gases. author: - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Hendrik full_name: Weimer, Hendrik last_name: Weimer citation: ama: Lemeshko M, Weimer H. Dissipative binding of atoms by non-conservative forces. Nature Communications. 2013;4. doi:10.1038/ncomms3230 apa: Lemeshko, M., & Weimer, H. (2013). Dissipative binding of atoms by non-conservative forces. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms3230 chicago: Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications. Nature Publishing Group, 2013. https://doi.org/10.1038/ncomms3230. ieee: M. Lemeshko and H. Weimer, “Dissipative binding of atoms by non-conservative forces,” Nature Communications, vol. 4. Nature Publishing Group, 2013. ista: Lemeshko M, Weimer H. 2013. Dissipative binding of atoms by non-conservative forces. Nature Communications. 4. mla: Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications, vol. 4, Nature Publishing Group, 2013, doi:10.1038/ncomms3230. short: M. Lemeshko, H. Weimer, Nature Communications 4 (2013). date_created: 2018-12-11T11:56:20Z date_published: 2013-07-30T00:00:00Z date_updated: 2021-01-12T06:55:59Z day: '30' doi: 10.1038/ncomms3230 extern: 1 intvolume: ' 4' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1211.4035 month: '07' oa: 1 publication: Nature Communications publication_status: published publisher: Nature Publishing Group publist_id: '4766' quality_controlled: 0 status: public title: Dissipative binding of atoms by non-conservative forces type: journal_article volume: 4 year: '2013' ... --- _id: '2210' abstract: - lang: eng text: 'A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.' author: - first_name: Therese full_name: Biedl, Therese last_name: Biedl - first_name: Martin full_name: Held, Martin last_name: Held - first_name: Stefan full_name: Huber, Stefan id: 4700A070-F248-11E8-B48F-1D18A9856A87 last_name: Huber orcid: 0000-0002-8871-5814 citation: ama: 'Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: 29th European Workshop on Computational Geometry. TU Braunschweig; 2013:95-98.' apa: 'Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In 29th European Workshop on Computational Geometry (pp. 95–98). Braunschweig, Germany: TU Braunschweig.' chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In 29th European Workshop on Computational Geometry, 95–98. TU Braunschweig, 2013. ieee: T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig, Germany, 2013, pp. 95–98. ista: 'Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.' mla: Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98. short: T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98. conference: end_date: 2013-03-20 location: Braunschweig, Germany name: 'EuroCG: European Workshop on Computational Geometry' start_date: 2013-03-17 date_created: 2018-12-11T11:56:21Z date_published: 2013-03-01T00:00:00Z date_updated: 2021-01-12T06:56:00Z day: '01' department: - _id: HeEd language: - iso: eng main_file_link: - open_access: '1' url: http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf month: '03' oa: 1 oa_version: Submitted Version page: 95 - 98 publication: 29th European Workshop on Computational Geometry publication_status: published publisher: TU Braunschweig publist_id: '4762' status: public title: Reconstructing polygons from embedded straight skeletons type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2237' abstract: - lang: eng text: We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation. alternative_title: - LNCS article_processing_charge: No author: - first_name: Régis full_name: Blanc, Régis last_name: Blanc - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Laura full_name: Kovács, Laura last_name: Kovács - first_name: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 citation: ama: Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13 apa: 'Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13' chicago: Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13. ieee: R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013. ista: Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181. mla: Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13. short: R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181. conference: end_date: 2013-12-19 location: Stellenbosch, South Africa name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning' start_date: 2013-12-14 date_created: 2018-12-11T11:56:29Z date_published: 2013-01-14T00:00:00Z date_updated: 2020-08-11T10:09:42Z day: '14' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-45221-5_13 file: - access_level: open_access checksum: 9cebaafca032e6769d273f393305c705 content_type: application/pdf creator: dernst date_created: 2020-05-15T11:10:40Z date_updated: 2020-07-14T12:45:34Z file_id: '7858' file_name: 2013_LPAR_Blanc.pdf file_size: 279206 relation: main_file file_date_updated: 2020-07-14T12:45:34Z has_accepted_license: '1' intvolume: ' 8312' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 173 - 181 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '4724' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Tree interpolation in Vampire type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8312 year: '2013' ... --- _id: '2238' abstract: - lang: eng text: "We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n" 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: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Dominik full_name: Wojtczak, Dominik last_name: Wojtczak citation: ama: Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17 apa: 'Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17' chicago: Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17. ieee: K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013. ista: Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242. mla: Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17. short: K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242. conference: end_date: 2013-12-19 location: Stellenbosch, South Africa name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning' start_date: 2013-12-14 date_created: 2018-12-11T11:56:30Z date_published: 2013-12-01T00:00:00Z date_updated: 2020-08-11T10:09:42Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-45221-5_17 ec_funded: 1 intvolume: ' 8312' language: - iso: eng month: '12' oa_version: None page: 228 - 242 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication_status: published publisher: Springer publist_id: '4723' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Multi-objective discounted reward verification in graphs and MDPs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8312 year: '2013' ... --- _id: '2243' abstract: - lang: eng text: We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME. alternative_title: - LIPIcs author: - first_name: Jakub full_name: Michaliszyn, Jakub last_name: Michaliszyn - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563 apa: 'Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563' chicago: Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563. ieee: J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013. ista: Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577. mla: Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563. short: J. Michaliszyn, J. Otop, 23 (2013) 563–577. conference: end_date: 2013-09-05 location: Torino, Italy name: 'CSL: Computer Science Logic' start_date: 2013-09-02 date_created: 2018-12-11T11:56:32Z date_published: 2013-09-01T00:00:00Z date_updated: 2020-08-11T10:09:42Z day: '01' ddc: - '000' - '004' department: - _id: ToHe doi: 10.4230/LIPIcs.CSL.2013.563 ec_funded: 1 file: - access_level: open_access checksum: e0732e73a8b1e39483df7717d53e3e35 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:11Z date_updated: 2020-07-14T12:45:34Z file_id: '4929' file_name: IST-2016-136-v1+2_39.pdf file_size: 454915 relation: main_file file_date_updated: 2020-07-14T12:45:34Z has_accepted_license: '1' intvolume: ' 23' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '09' oa: 1 oa_version: Published Version page: 563 - 577 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '4708' pubrep_id: '136' quality_controlled: '1' scopus_import: 1 series_title: Leibniz International Proceedings in Informatics status: public title: Elementary modal logics over transitive structures 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2013' ... --- _id: '2244' abstract: - lang: eng text: 'We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. ' acknowledgement: We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence. alternative_title: - LNCS author: - first_name: Jiří full_name: Matoušek, Jiří last_name: Matoušek - first_name: Eric full_name: Sedgwick, Eric last_name: Sedgwick - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41 apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41' chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-03841-4_41. ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013. ista: Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483. mla: Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves. Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41. short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483. conference: end_date: 2013-09-25 location: Bordeaux, France name: 'GD: Graph Drawing and Network Visualization' start_date: 2013-09-23 date_created: 2018-12-11T11:56:32Z date_published: 2013-09-01T00:00:00Z date_updated: 2023-02-21T17:03:07Z day: '01' department: - _id: UlWa doi: 10.1007/978-3-319-03841-4_41 external_id: arxiv: - '1302.6475' intvolume: ' 8242' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1302.6475 month: '09' oa: 1 oa_version: Preprint page: 472 - 483 project: - _id: 25FA3206-B435-11E9-9278-68D0E5697425 grant_number: PP00P2_138948 name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics' publication_status: published publisher: Springer publist_id: '4707' quality_controlled: '1' related_material: record: - id: '1411' relation: later_version status: public scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Untangling two systems of noncrossing curves type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8242 year: '2013' ... --- _id: '2259' abstract: - lang: eng text: "The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n" alternative_title: - LNCS author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Stephan full_name: Krenn, Stephan id: 329FCCF0-F248-11E8-B48F-1D18A9856A87 last_name: Krenn orcid: 0000-0003-2835-9093 - 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: Daniel full_name: Wichs, Daniel last_name: Wichs citation: ama: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4' apa: 'Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4' chicago: 'Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.' ieee: 'J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.' ista: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.' mla: 'Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.' short: J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74. conference: end_date: 2013-08-22 location: Santa Barbara, CA, United States name: 'CRYPTO: International Cryptology Conference' start_date: 2013-08-18 date_created: 2018-12-11T11:56:37Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:56:21Z day: '01' ddc: - '000' - '004' department: - _id: KrPi doi: 10.1007/978-3-642-40041-4_4 ec_funded: 1 file: - access_level: open_access checksum: 16d428408a806b8e49eecc607deab115 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:55Z date_updated: 2020-07-14T12:45:35Z file_id: '4912' file_name: IST-2016-684-v1+1_098.pdf file_size: 587898 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 8042' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 57 - 74 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication_status: published publisher: Springer publist_id: '4687' pubrep_id: '684' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: 'Learning with rounding, revisited: New reduction properties and applications' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8042 year: '2013' ... --- _id: '2258' abstract: - lang: eng text: "In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n" alternative_title: - LNCS 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: Mario full_name: Szegedy, Mario last_name: Szegedy citation: ama: Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31 apa: 'Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31' chicago: Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31. ieee: E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013. ista: Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588. mla: Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31. short: E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588. conference: end_date: 2013-08-22 location: Santa Barbara, CA, United States name: 'CRYPTO: International Cryptology Conference' start_date: 2013-08-18 date_created: 2018-12-11T11:56:37Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:56:21Z day: '01' ddc: - '000' - '004' department: - _id: KrPi doi: 10.1007/978-3-642-40041-4_31 ec_funded: 1 file: - access_level: open_access checksum: 18a3f602cb41de184dc0e16a0e907633 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:20Z date_updated: 2020-07-14T12:45:35Z file_id: '4744' file_name: IST-2016-685-v1+1_658.pdf file_size: 493175 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 8042' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 571 - 588 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication_status: published publisher: Springer publist_id: '4688' pubrep_id: '685' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Digital signatures with minimal overhead from indifferentiable random invertible functions type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8042 year: '2013' ... --- _id: '2256' abstract: - lang: eng text: Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license. - lang: ger text: "Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte." author: - first_name: Patrick full_name: Danowski, Patrick id: 2EBD1598-F248-11E8-B48F-1D18A9856A87 last_name: Danowski orcid: 0000-0002-6026-4409 - first_name: Doron full_name: Goldfarb, Doron last_name: Goldfarb - first_name: Verena full_name: Schaffner, Verena last_name: Schaffner - first_name: Wolfram full_name: Seidler, Wolfram last_name: Seidler citation: ama: Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587. apa: Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare. chicago: Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013. ieee: P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013. ista: Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587. mla: Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87. short: P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587. date_created: 2018-12-11T11:56:36Z date_published: 2013-12-01T00:00:00Z date_updated: 2021-01-12T06:56:20Z day: '01' ddc: - '020' department: - _id: E-Lib file: - access_level: open_access checksum: ae57ffcee3720adcc27b0f2767a1e04b content_type: application/pdf creator: system date_created: 2018-12-12T10:08:09Z date_updated: 2020-07-14T12:45:35Z file_id: '4669' file_name: IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf file_size: 881545 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 66' issue: 3/4 language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 559 - 587 popular_science: '1' publication: VÖB Mitteilungen publication_status: published publisher: Verein Österreichischer Bibliothekarinnen und Bibliothekare publist_id: '4690' pubrep_id: '719' status: public title: Linked (Open) Data - Bibliographische Daten im Semantic Web 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 66 year: '2013' ... --- _id: '2260' abstract: - lang: eng text: "Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.\r\n" alternative_title: - LNCS author: - first_name: David full_name: Bernhard, David last_name: Bernhard - first_name: Georg full_name: Fuchsbauer, Georg id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87 last_name: Fuchsbauer - first_name: Essam full_name: Ghadafi, Essam last_name: Ghadafi citation: ama: Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and DAA in the standard model. 2013;7954:518-533. doi:10.1007/978-3-642-38980-1_33 apa: 'Bernhard, D., Fuchsbauer, G., & Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-642-38980-1_33' chicago: Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-38980-1_33. ieee: D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013. ista: Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge and DAA in the standard model. 7954, 518–533. mla: Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33. short: D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533. conference: end_date: 2013-06-28 location: Banff, AB, Canada name: 'ACNS: Applied Cryptography and Network Security' start_date: 2013-06-25 date_created: 2018-12-11T11:56:37Z date_published: 2013-06-01T00:00:00Z date_updated: 2020-08-11T10:09:44Z day: '01' department: - _id: KrPi doi: 10.1007/978-3-642-38980-1_33 intvolume: ' 7954' language: - iso: eng main_file_link: - open_access: '1' url: http://eprint.iacr.org/2012/475 month: '06' oa: 1 oa_version: Submitted Version page: 518 - 533 publication_status: published publisher: Springer publist_id: '4686' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Efficient signatures of knowledge and DAA in the standard model type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7954 year: '2013' ... --- _id: '2264' abstract: - lang: eng text: Faithful progression through the cell cycle is crucial to the maintenance and developmental potential of stem cells. Here, we demonstrate that neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in two temporally and spatially distinct progenitor domains. Differential conditional deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal olfactory bulb progenitors disrupted transitions through G1, G2 and M phases, whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified by deletion of Sp2 using mosaic analysis with double markers, which clearly established that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly, conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis in the embryonic and postnatal brain. article_processing_charge: No author: - first_name: Huixuan full_name: Liang, Huixuan last_name: Liang - first_name: Guanxi full_name: Xiao, Guanxi last_name: Xiao - first_name: Haifeng full_name: Yin, Haifeng last_name: Yin - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Jonathan full_name: Horowitz, Jonathan last_name: Horowitz - first_name: Troy full_name: Ghashghaei, Troy last_name: Ghashghaei citation: ama: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 2013;140(3):552-561. doi:10.1242/dev.085621 apa: Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei, T. (2013). Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621 chicago: Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz, and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development. Company of Biologists, 2013. https://doi.org/10.1242/dev.085621. ieee: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei, “Neural development is dependent on the function of specificity protein 2 in cell cycle progression,” Development, vol. 140, no. 3. Company of Biologists, pp. 552–561, 2013. ista: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 140(3), 552–561. mla: Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140, no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621. short: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development 140 (2013) 552–561. date_created: 2018-12-11T11:56:39Z date_published: 2013-02-01T00:00:00Z date_updated: 2021-01-12T06:56:23Z day: '01' department: - _id: SiHi doi: 10.1242/dev.085621 external_id: pmid: - '23293287' intvolume: ' 140' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/ month: '02' oa: 1 oa_version: Submitted Version page: 552 - 561 pmid: 1 publication: Development publication_status: published publisher: Company of Biologists publist_id: '4681' quality_controlled: '1' scopus_import: 1 status: public title: Neural development is dependent on the function of specificity protein 2 in cell cycle progression type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2013' ... --- _id: '2269' abstract: - lang: eng text: This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods. acknowledgement: "Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. " author: - first_name: Thomas full_name: Thomas Auzinger id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Michael full_name: Wimmer, Michael last_name: Wimmer - first_name: Stefan full_name: Stefan Jeschke id: 44D6411A-F248-11E8-B48F-1D18A9856A87 last_name: Jeschke citation: ama: 'Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. Computer Graphics Forum. 2013;32(124):409-418. doi:DOI: 10.1111/cgf.12061' apa: 'Auzinger, T., Wimmer, M., & Jeschke, S. (2013). Analytic Visibility on the GPU. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/DOI: 10.1111/cgf.12061' chicago: 'Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” Computer Graphics Forum. Wiley-Blackwell, 2013. https://doi.org/DOI: 10.1111/cgf.12061.' ieee: T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” Computer Graphics Forum, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013. ista: Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418. mla: 'Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” Computer Graphics Forum, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:DOI: 10.1111/cgf.12061.' short: T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418. date_created: 2018-12-11T11:56:40Z date_published: 2013-05-06T00:00:00Z date_updated: 2021-01-12T06:56:25Z day: '06' doi: 'DOI: 10.1111/cgf.12061' extern: 1 intvolume: ' 32' issue: 124 month: '05' page: 409 - 418 publication: Computer Graphics Forum publication_status: published publisher: Wiley-Blackwell publist_id: '4675' quality_controlled: 0 status: public title: Analytic Visibility on the GPU type: journal_article volume: 32 year: '2013' ... --- _id: '2270' abstract: - lang: eng text: "Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inher-\r\nent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard \ it is computationally to optimize and solve such games. One prominent such \ language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation (Deng and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We consider the problem of finding \ the optimal coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We show that finding the optimal coalition structure is not only hard for general graphs, but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems. \ We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs." author: - first_name: Yoram full_name: Bachrach, Yoram last_name: Bachrach - first_name: Pushmeet full_name: Kohli, Pushmeet last_name: Kohli - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Morteza full_name: Zadimoghaddam, Morteza last_name: Zadimoghaddam citation: ama: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.' apa: 'Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.' chicago: Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013. ieee: 'Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.' ista: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.' mla: Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87. short: Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87. conference: end_date: 2013-07-18 location: Bellevue, WA, United States name: 'AAAI: Conference on Artificial Intelligence' start_date: 2013-07-14 date_created: 2018-12-11T11:56:41Z date_published: 2013-12-31T00:00:00Z date_updated: 2021-01-12T06:56:25Z day: '31' department: - _id: VlKo external_id: arxiv: - '1108.5248' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1108.5248 month: '12' oa: 1 oa_version: None page: 81-87 publication_status: published publisher: AAAI Press publist_id: '4674' quality_controlled: '1' status: public title: Optimal Coalition Structures in Cooperative Graph Games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2273' abstract: - lang: eng text: We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results. author: - first_name: Vladimir full_name: Vladimir Kolmogorov id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013. apa: Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria. chicago: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013. ieee: V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013. ista: Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p. mla: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013. short: V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013. date_created: 2018-12-11T11:56:42Z date_published: 2013-09-22T00:00:00Z date_updated: 2019-01-24T13:07:32Z day: '22' department: - _id: VlKo extern: 0 main_file_link: - open_access: '1' url: http://arxiv.org/abs/1309.5655 month: '09' oa: 1 publication_status: published publisher: IST Austria publist_id: '4671' quality_controlled: 0 status: public title: Reweighted message passing revisited type: report year: '2013' ... --- _id: '2278' abstract: - lang: eng text: It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling. author: - first_name: Raquel full_name: Pérez Gómez, Raquel last_name: Pérez Gómez - first_name: Jana full_name: Slovakova, Jana id: 30F3F2F0-F248-11E8-B48F-1D18A9856A87 last_name: Slovakova - first_name: Noemí full_name: Rives Quinto, Noemí last_name: Rives Quinto - first_name: Alena full_name: Krejčí, Alena last_name: Krejčí - first_name: Ana full_name: Carmena, Ana last_name: Carmena citation: ama: Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 2013;126(21):4873-4884. doi:10.1242/jcs.125617 apa: Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., & Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.125617 chicago: Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science. Company of Biologists, 2013. https://doi.org/10.1242/jcs.125617. ieee: R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” Journal of Cell Science, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013. ista: Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884. mla: Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:10.1242/jcs.125617. short: R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884. date_created: 2018-12-11T11:56:43Z date_published: 2013-11-01T00:00:00Z date_updated: 2021-01-12T06:56:29Z day: '01' department: - _id: CaHe doi: 10.1242/jcs.125617 intvolume: ' 126' issue: '21' language: - iso: eng month: '11' oa_version: None page: 4873 - 4884 publication: Journal of Cell Science publication_status: published publisher: Company of Biologists publist_id: '4658' quality_controlled: '1' scopus_import: 1 status: public title: A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 126 year: '2013' ... --- _id: '2276' abstract: - lang: eng text: The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions. author: - first_name: Igor full_name: Gridchyn, Igor id: 4B60654C-F248-11E8-B48F-1D18A9856A87 last_name: Gridchyn - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288' apa: 'Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288' chicago: Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288. ieee: 'I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.' ista: 'Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.' mla: Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288. short: I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327. conference: end_date: 2013-12-08 location: Sydney, Australia name: 'ICCV: International Conference on Computer Vision' start_date: 2013-12-01 date_created: 2018-12-11T11:56:43Z date_published: 2013-12-01T00:00:00Z date_updated: 2021-01-12T06:56:28Z day: '01' department: - _id: JoCs - _id: VlKo doi: 10.1109/ICCV.2013.288 external_id: arxiv: - '1310.1771' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1310.1771 month: '12' oa: 1 oa_version: Preprint page: 2320 - 2327 publication_status: published publisher: IEEE publist_id: '4668' quality_controlled: '1' status: public title: Potts model, parametric maxflow and k-submodular functions type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2280' abstract: - lang: eng text: The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented. author: - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Stephen full_name: Wright, Stephen last_name: Wright citation: ama: Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706. doi:10.1137/120872309 apa: Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM Review. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120872309 chicago: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120872309. ieee: C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013. ista: Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706. mla: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:10.1137/120872309. short: C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706. date_created: 2018-12-11T11:56:44Z date_published: 2013-11-07T00:00:00Z date_updated: 2021-01-12T06:56:30Z day: '07' department: - _id: CaUh doi: 10.1137/120872309 external_id: arxiv: - '1204.0235' intvolume: ' 55' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1204.0235 month: '11' oa: 1 oa_version: Preprint page: 671 - 706 publication: SIAM Review publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '4655' quality_controlled: '1' scopus_import: 1 status: public title: Packing ellipsoids with overlap type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 55 year: '2013' ... --- _id: '2287' abstract: - lang: eng text: Negative frequency-dependent selection should result in equal sex ratios in large populations of dioecious flowering plants, but deviations from equality are commonly reported. A variety of ecological and genetic factors can explain biased sex ratios, although the mechanisms involved are not well understood. Most dioecious species are long-lived and/or clonal complicating efforts to identify stages during the life cycle when biases develop. We investigated the demographic correlates of sex-ratio variation in two chromosome races of Rumex hastatulus, an annual, wind-pollinated colonizer of open habitats from the southern USA. We examined sex ratios in 46 populations and evaluated the hypothesis that the proximity of males in the local mating environment, through its influence on gametophytic selection, is the primary cause of female-biased sex ratios. Female-biased sex ratios characterized most populations of R. hastatulus (mean sex ratio = 0.62), with significant female bias in 89% of populations. Large, high-density populations had the highest proportion of females, whereas smaller, low-density populations had sex ratios closer to equality. Progeny sex ratios were more female biased when males were in closer proximity to females, a result consistent with the gametophytic selection hypothesis. Our results suggest that interactions between demographic and genetic factors are probably the main cause of female-biased sex ratios in R. hastatulus. The annual life cycle of this species may limit the scope for selection against males and may account for the weaker degree of bias in comparison with perennial Rumex species. author: - first_name: Melinda full_name: Pickup, Melinda id: 2C78037E-F248-11E8-B48F-1D18A9856A87 last_name: Pickup orcid: 0000-0001-6118-0541 - first_name: Spencer full_name: Barrett, Spencer last_name: Barrett citation: ama: Pickup M, Barrett S. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 2013;3(3):629-639. doi:10.1002/ece3.465 apa: Pickup, M., & Barrett, S. (2013). The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.465 chicago: Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution. Wiley-Blackwell, 2013. https://doi.org/10.1002/ece3.465. ieee: M. Pickup and S. Barrett, “The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant,” Ecology and Evolution, vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013. ista: Pickup M, Barrett S. 2013. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3), 629–639. mla: Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:10.1002/ece3.465. short: M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639. date_created: 2018-12-11T11:56:47Z date_published: 2013-03-01T00:00:00Z date_updated: 2021-01-12T06:56:32Z day: '01' ddc: - '576' department: - _id: NiBa doi: 10.1002/ece3.465 file: - access_level: open_access checksum: b5531bab4c0dec396bf5c8497fe178bf content_type: application/pdf creator: system date_created: 2018-12-12T10:17:35Z date_updated: 2020-07-14T12:45:37Z file_id: '5290' file_name: IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf file_size: 626949 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 3' issue: '3' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 629 - 639 publication: Ecology and Evolution publication_status: published publisher: Wiley-Blackwell publist_id: '4644' pubrep_id: '416' quality_controlled: '1' scopus_import: 1 status: public title: The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2013' ... --- _id: '2282' abstract: - lang: eng text: Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly. acknowledged_ssus: - _id: PreCl - _id: Bio acknowledgement: 'This work was supported by the IST Austria and MPI-CBG ' author: - first_name: Pedro full_name: Campinho, Pedro id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87 last_name: Campinho orcid: 0000-0002-8526-5416 - first_name: Martin full_name: Behrndt, Martin id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87 last_name: Behrndt - first_name: Jonas full_name: Ranft, Jonas last_name: Ranft - first_name: Thomas full_name: Risler, Thomas last_name: Risler - first_name: Nicolas full_name: Minc, Nicolas last_name: Minc - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 2013;15:1405-1414. doi:10.1038/ncb2869 apa: Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., & Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb2869 chicago: Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/ncb2869. ieee: P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” Nature Cell Biology, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013. ista: Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414. mla: Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:10.1038/ncb2869. short: P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414. date_created: 2018-12-11T11:56:45Z date_published: 2013-11-10T00:00:00Z date_updated: 2023-02-21T17:02:44Z day: '10' department: - _id: CaHe doi: 10.1038/ncb2869 intvolume: ' 15' language: - iso: eng main_file_link: - open_access: '1' url: http://hal.upmc.fr/hal-00983313/ month: '11' oa: 1 oa_version: Submitted Version page: 1405 - 1414 project: - _id: 252ABD0A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I 930-B20 name: Control of Epithelial Cell Layer Spreading in Zebrafish publication: Nature Cell Biology publication_status: published publisher: Nature Publishing Group publist_id: '4652' quality_controlled: '1' related_material: record: - id: '1403' relation: dissertation_contains status: public scopus_import: 1 status: public title: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2013' ... --- _id: '2283' abstract: - lang: eng text: Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success. author: - first_name: Christopher full_name: Pull, Christopher id: 3C7F4840-F248-11E8-B48F-1D18A9856A87 last_name: Pull orcid: 0000-0003-1122-3982 - first_name: William full_name: Hughes, William last_name: Hughes - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown citation: ama: 'Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 2013;100(12):1125-1136. doi:10.1007/s00114-013-1115-5' apa: 'Pull, C., Hughes, W., & Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-013-1115-5' chicago: 'Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften. Springer, 2013. https://doi.org/10.1007/s00114-013-1115-5.' ieee: 'C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” Naturwissenschaften, vol. 100, no. 12. Springer, pp. 1125–1136, 2013.' ista: 'Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.' mla: 'Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:10.1007/s00114-013-1115-5.' short: C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136. date_created: 2018-12-11T11:56:45Z date_published: 2013-11-14T00:00:00Z date_updated: 2021-01-12T06:56:31Z day: '14' department: - _id: SyCr doi: 10.1007/s00114-013-1115-5 intvolume: ' 100' issue: '12' language: - iso: eng month: '11' oa_version: None page: 1125 - 1136 publication: Naturwissenschaften publication_status: published publisher: Springer publist_id: '4649' quality_controlled: '1' scopus_import: 1 status: public title: 'Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 100 year: '2013' ... --- _id: '2286' abstract: - lang: eng text: The spatiotemporal control of cell divisions is a key factor in epithelial morphogenesis and patterning. Mao et al (2013) now describe how differential rates of proliferation within the Drosophila wing disc epithelium give rise to anisotropic tissue tension in peripheral/proximal regions of the disc. Such global tissue tension anisotropy in turn determines the orientation of cell divisions by controlling epithelial cell elongation. author: - first_name: Pedro full_name: Campinho, Pedro id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87 last_name: Campinho orcid: 0000-0002-8526-5416 - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. EMBO Journal. 2013;32(21):2783-2784. doi:10.1038/emboj.2013.225 apa: Campinho, P., & Heisenberg, C.-P. J. (2013). The force and effect of cell proliferation. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2013.225 chicago: Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal. Wiley-Blackwell, 2013. https://doi.org/10.1038/emboj.2013.225. ieee: P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,” EMBO Journal, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013. ista: Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation. EMBO Journal. 32(21), 2783–2784. mla: Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal, vol. 32, no. 21, Wiley-Blackwell, 2013, pp. 2783–84, doi:10.1038/emboj.2013.225. short: P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784. date_created: 2018-12-11T11:56:46Z date_published: 2013-10-04T00:00:00Z date_updated: 2021-01-12T06:56:32Z day: '04' department: - _id: CaHe doi: 10.1038/emboj.2013.225 external_id: pmid: - '24097062' intvolume: ' 32' issue: '21' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/ month: '10' oa: 1 oa_version: Submitted Version page: 2783 - 2784 pmid: 1 publication: EMBO Journal publication_status: published publisher: Wiley-Blackwell publist_id: '4645' quality_controlled: '1' scopus_import: 1 status: public title: The force and effect of cell proliferation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2013' ... --- _id: '2289' abstract: - lang: eng text: Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments. author: - 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: Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7 apa: Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7 chicago: Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7. ieee: T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013. ista: Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344. mla: Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7. short: T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344. date_created: 2018-12-11T11:56:47Z date_published: 2013-10-05T00:00:00Z date_updated: 2021-01-12T06:56:33Z day: '05' ddc: - '000' department: - _id: ToHe doi: 10.1007/s00450-013-0251-7 ec_funded: 1 file: - access_level: open_access checksum: f117a00f9f046165bfa95595681e08a0 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:51Z date_updated: 2020-07-14T12:45:37Z file_id: '5308' file_name: IST-2016-626-v1+1_s00450-013-0251-7.pdf file_size: 570361 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 28' issue: '4' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 331 - 344 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: Computer Science Research and Development publication_status: published publisher: Springer publist_id: '4642' pubrep_id: '626' quality_controlled: '1' scopus_import: 1 status: public title: Quantitative reactive modeling and verification 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 28 year: '2013' ... --- _id: '2290' abstract: - lang: eng text: The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development. author: - first_name: Yohann full_name: Boutté, Yohann last_name: Boutté - first_name: Kristoffer full_name: Jonsson, Kristoffer last_name: Jonsson - first_name: Heather full_name: Mcfarlane, Heather last_name: Mcfarlane - first_name: Errin full_name: Johnson, Errin last_name: Johnson - first_name: Delphine full_name: Gendre, Delphine last_name: Gendre - first_name: Ranjan full_name: Swarup, Ranjan last_name: Swarup - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Lacey full_name: Samuels, Lacey last_name: Samuels - first_name: Stéphanie full_name: Robert, Stéphanie last_name: Robert - first_name: Rishikesh full_name: Bhalerao, Rishikesh last_name: Bhalerao citation: ama: Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264. doi:10.1073/pnas.1309057110 apa: Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110 chicago: Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110. ieee: Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013. ista: Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264. mla: Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110. short: Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264. date_created: 2018-12-11T11:56:48Z date_published: 2013-10-01T00:00:00Z date_updated: 2021-01-12T06:56:33Z day: '01' department: - _id: JiFr doi: 10.1073/pnas.1309057110 external_id: pmid: - '24043780' intvolume: ' 110' issue: '40' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/ month: '10' oa: 1 oa_version: Submitted Version page: 16259 - 16264 pmid: 1 publication: PNAS publication_status: published publisher: National Academy of Sciences publist_id: '4639' quality_controlled: '1' scopus_import: 1 status: public title: ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 110 year: '2013' ... --- _id: '2294' abstract: - lang: eng text: "In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information: one is a classifier trained on strongly invariant features, which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally that while neither of the methods \ can be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance." author: - first_name: Tomas full_name: Kazmar, Tomas last_name: Kazmar - first_name: Evgeny full_name: Kvon, Evgeny last_name: Kvon - first_name: Alexander full_name: Stark, Alexander last_name: Stark - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139' apa: 'Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139' chicago: Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139. ieee: 'T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013.' ista: 'Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.' mla: Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation. IEEE, 2013, doi:10.1109/ICCV.2013.139. short: T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013. conference: end_date: 2013-12-08 location: Sydney, Australia name: 'ICCV: International Conference on Computer Vision' start_date: 2013-12-01 date_created: 2018-12-11T11:56:49Z date_published: 2013-12-01T00:00:00Z date_updated: 2021-01-12T06:56:35Z day: '01' department: - _id: ChLa doi: 10.1109/ICCV.2013.139 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://www.cv-foundation.org/openaccess/ICCV2013.py month: '12' oa: 1 oa_version: Submitted Version project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication_status: published publisher: IEEE publist_id: '4634' quality_controlled: '1' scopus_import: 1 status: public title: Drosophila Embryo Stage Annotation using Label Propagation type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2292' abstract: - lang: eng text: This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence. alternative_title: - LNCS citation: ama: Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science 2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2 apa: 'Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2' chicago: Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2. ieee: K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854. ista: Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p. mla: Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2. short: K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013. conference: end_date: 2013-08-30 location: Klosterneuburg, Austria name: 'MFCS: Mathematical Foundations of Computer Science' start_date: 2013-08-26 date_created: 2018-12-11T11:56:48Z date_published: 2013-08-08T00:00:00Z date_updated: 2020-08-11T10:09:45Z day: '08' department: - _id: KrCh doi: 10.1007/978-3-642-40313-2 editor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Jiri full_name: Sgall, Jiri last_name: Sgall intvolume: ' 8087' language: - iso: eng month: '08' oa_version: None page: VI - 854 publication_identifier: isbn: - 978-3-642-40312-5 publication_status: published publisher: Springer publist_id: '4636' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Mathematical Foundations of Computer Science 2013 type: conference_editor user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8087 year: '2013' ... --- _id: '2293' abstract: - lang: eng text: Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results. author: - first_name: Viktoriia full_name: Sharmanska, Viktoriia id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87 last_name: Sharmanska orcid: 0000-0003-0192-9308 - first_name: Novi full_name: Quadrianto, Novi last_name: Quadrianto - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107' apa: 'Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107' chicago: Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107. ieee: 'V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832.' ista: 'Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832.' mla: Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information. IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107. short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832. conference: end_date: 2013-12-08 location: Sydney, Australia name: 'ICCV: International Conference on Computer Vision' start_date: 2013-12-01 date_created: 2018-12-11T11:56:49Z date_published: 2013-12-01T00:00:00Z date_updated: 2023-02-23T10:36:41Z day: '01' department: - _id: ChLa doi: 10.1109/ICCV.2013.107 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf month: '12' oa: 1 oa_version: Submitted Version page: 825 - 832 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication_status: published publisher: IEEE publist_id: '4635' quality_controlled: '1' scopus_import: 1 status: public title: Learning to rank using privileged information type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2291' abstract: - lang: eng text: "Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n" author: - first_name: Anna full_name: Ferrara, Anna last_name: Ferrara - first_name: Georg full_name: Fuchsbauer, Georg id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87 last_name: Fuchsbauer - first_name: Bogdan full_name: Warinschi, Bogdan last_name: Warinschi citation: ama: 'Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:10.1109/CSF.2013.15' apa: 'Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15' chicago: Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15. ieee: 'A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.' ista: 'Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.' mla: Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15. short: A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129. conference: end_date: 2013-09-28 location: New Orleans, LA, United States name: 'CSF: Computer Security Foundations' start_date: 2013-09-26 date_created: 2018-12-11T11:56:48Z date_published: 2013-09-01T00:00:00Z date_updated: 2021-01-12T06:56:34Z day: '01' department: - _id: KrPi doi: 10.1109/CSF.2013.15 language: - iso: eng main_file_link: - open_access: '1' url: http://eprint.iacr.org/2013/492 month: '09' oa: 1 oa_version: Submitted Version page: 115 - 129 publication_status: published publisher: IEEE publist_id: '4637' quality_controlled: '1' scopus_import: 1 status: public title: Cryptographically enforced RBAC type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2288' abstract: - lang: eng text: This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms. alternative_title: - LNCS citation: ama: Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6 apa: 'Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6' chicago: Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6. ieee: A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013. ista: Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p. mla: Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6. short: A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013. conference: end_date: 2013-09-24 location: Klosterneuburg, Austria name: 'CMSB: Computational Methods in Systems Biology' start_date: 2013-09-22 date_created: 2018-12-11T11:56:47Z date_published: 2013-07-01T00:00:00Z date_updated: 2019-08-02T12:37:44Z day: '01' department: - _id: ToHe doi: 10.1007/978-3-642-40708-6 editor: - 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 intvolume: ' 8130' language: - iso: eng month: '07' oa_version: None publication_identifier: isbn: - 978-3-642-40707-9 publication_status: published publisher: Springer publist_id: '4643' quality_controlled: '1' status: public title: Computational Methods in Systems Biology type: conference_editor user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8130 year: '2013' ... --- _id: '2298' abstract: - lang: eng text: "We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n" alternative_title: - LNCS author: - first_name: Cezara full_name: Dragoi, Cezara id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87 last_name: Dragoi - first_name: Constantin full_name: Enea, Constantin last_name: Enea - first_name: Mihaela full_name: Sighireanu, Mihaela last_name: Sighireanu citation: ama: 'Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10' apa: 'Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10' chicago: Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10. ieee: 'C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.' ista: 'Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.' mla: Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10. short: C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171. conference: end_date: 2013-06-22 location: Seattle, WA, United States name: 'SAS: Static Analysis Symposium' start_date: 2013-06-20 date_created: 2018-12-11T11:56:50Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:56:36Z day: '01' ddc: - '000' - '004' department: - _id: ToHe doi: 10.1007/978-3-642-38856-9_10 ec_funded: 1 file: - access_level: open_access checksum: 907edd33a5892e3af093365f1fd57ed7 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:36Z date_updated: 2020-07-14T12:45:37Z file_id: '4824' file_name: IST-2014-196-v1+1_sas13.pdf file_size: 299004 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 7935' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 150 - 171 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '4630' pubrep_id: '196' quality_controlled: '1' scopus_import: 1 status: public title: Local shape analysis for overlaid data structures type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7935 year: '2013' ... --- _id: '2299' abstract: - lang: eng text: 'The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol.' author: - first_name: Yashdeep full_name: Godhal, Yashdeep id: 5B547124-EB61-11E9-8887-89D9C04DBDF5 last_name: Godhal - 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 citation: ama: 'Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9' apa: 'Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9' chicago: 'Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.' ieee: 'Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.' ista: 'Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.' mla: 'Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.' short: Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601. date_created: 2018-12-11T11:56:51Z date_published: 2013-10-01T00:00:00Z date_updated: 2021-01-12T06:56:37Z day: '01' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/s10009-011-0207-9 file: - access_level: open_access checksum: 57b06a732dd8d6349190dba6b5b0d33b content_type: application/pdf creator: system date_created: 2018-12-12T10:11:53Z date_updated: 2020-07-14T12:45:37Z file_id: '4910' file_name: IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf file_size: 277372 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 15' issue: 5-6 language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 585 - 601 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: International Journal on Software Tools for Technology Transfer publication_status: published publisher: Springer publist_id: '4629' pubrep_id: '87' quality_controlled: '1' scopus_import: 1 status: public title: 'Synthesis of AMBA AHB from formal specification: A case study' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2013' ... --- _id: '2297' abstract: - lang: eng text: We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation. author: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Seiringer R. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5' apa: 'Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5' chicago: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.' ieee: 'R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232, 2013.' ista: 'Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232.' mla: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:10.1007/s11537-013-1264-5.' short: R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232. date_created: 2018-12-11T11:56:50Z date_published: 2013-09-24T00:00:00Z date_updated: 2021-01-12T06:56:36Z day: '24' department: - _id: RoSe doi: 10.1007/s11537-013-1264-5 external_id: arxiv: - '0908.3686' intvolume: ' 8' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/0908.3686 month: '09' oa: 1 oa_version: Preprint page: 185 - 232 publication: Japanese Journal of Mathematics publication_status: published publisher: Springer publist_id: '4631' quality_controlled: '1' scopus_import: 1 status: public title: 'Hot topics in cold gases: A mathematical physics perspective' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2013' ... --- _id: '2306' abstract: - lang: ger text: Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind. alternative_title: - Bibliotheks- und Informationspraxis article_processing_charge: No author: - first_name: Patrick full_name: Danowski, Patrick id: 2EBD1598-F248-11E8-B48F-1D18A9856A87 last_name: Danowski orcid: 0000-0002-6026-4409 - first_name: Adrian full_name: Pohl, Adrian last_name: Pohl citation: ama: Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter; 2013. doi:10.1515/9783110278736 apa: Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken (Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736 chicago: Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736. ieee: P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50. De Gruyter, 2013. ista: Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p. mla: Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736. short: P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013. date_created: 2018-12-11T11:56:53Z date_published: 2013-09-13T00:00:00Z date_updated: 2021-12-21T12:17:19Z day: '13' ddc: - '020' department: - _id: E-Lib doi: 10.1515/9783110278736 file: - access_level: open_access checksum: 807a408bbee519d792702828a32c6e85 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:49Z date_updated: 2020-07-14T12:45:38Z file_id: '4774' file_name: IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf file_size: 67731 relation: main_file - access_level: open_access checksum: 587e95c2ba24307a5a5d5bd1579429d9 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:50Z date_updated: 2020-07-14T12:45:38Z file_id: '4775' file_name: IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf file_size: 43563 relation: main_file - access_level: open_access checksum: dbcada36bb32d725d9838615706e700f content_type: application/pdf creator: system date_created: 2018-12-12T10:09:51Z date_updated: 2020-07-14T12:45:38Z file_id: '4776' file_name: IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf file_size: 11318599 relation: main_file - access_level: open_access checksum: 5235712bf0a49ccc8c2cb4f6c2560d43 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:52Z date_updated: 2020-07-14T12:45:38Z file_id: '4777' file_name: IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf file_size: 330210 relation: main_file - access_level: open_access checksum: d851cc91f705da80617ac7df33c1c0e1 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:53Z date_updated: 2020-07-14T12:45:38Z file_id: '4778' file_name: IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf file_size: 10652088 relation: main_file - access_level: open_access checksum: 4e77b182692c58e50fc5251bf23cc584 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:54Z date_updated: 2020-07-14T12:45:38Z file_id: '4779' file_name: IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf file_size: 6125273 relation: main_file - access_level: open_access checksum: 3debae38064d5099d22f855c353a57ec content_type: application/pdf creator: system date_created: 2018-12-12T10:09:55Z date_updated: 2020-07-14T12:45:38Z file_id: '4780' file_name: IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf file_size: 1893872 relation: main_file - access_level: open_access checksum: e630b330dc0b7522d2cf204587030252 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:56Z date_updated: 2020-07-14T12:45:38Z file_id: '4781' file_name: IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf file_size: 1095929 relation: main_file - access_level: open_access checksum: 17edda91271bfcce8e1b6e77ca1c9d11 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:57Z date_updated: 2020-07-14T12:45:38Z file_id: '4782' file_name: IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf file_size: 149699 relation: main_file - access_level: open_access checksum: aacef6734b1de58aeb58024fc47c2373 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:58Z date_updated: 2020-07-14T12:45:38Z file_id: '4783' file_name: IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf file_size: 8828405 relation: main_file - access_level: open_access checksum: 0619451f7ff3ea641ce0b10c97831f47 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:59Z date_updated: 2020-07-14T12:45:38Z file_id: '4784' file_name: IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf file_size: 3191208 relation: main_file - access_level: open_access checksum: 44dc8a9fc003f0edd912968958715a23 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:00Z date_updated: 2020-07-14T12:45:38Z file_id: '4785' file_name: IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf file_size: 78315 relation: main_file - access_level: open_access checksum: 48133cecebfd839b77f84f557d530c00 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:01Z date_updated: 2020-07-14T12:45:38Z file_id: '4786' file_name: IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf file_size: 90532 relation: main_file - access_level: open_access checksum: a359224ddfdb178fed72b228dcfb699a content_type: application/pdf creator: system date_created: 2018-12-12T10:10:02Z date_updated: 2020-07-14T12:45:38Z file_id: '4787' file_name: IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf file_size: 90771 relation: main_file - access_level: open_access checksum: 0d2dd31d537c7a495999149d00eaffbf content_type: application/pdf creator: system date_created: 2018-12-12T10:10:03Z date_updated: 2020-07-14T12:45:38Z file_id: '4788' file_name: IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf file_size: 1830232 relation: main_file file_date_updated: 2020-07-14T12:45:38Z has_accepted_license: '1' intvolume: ' 50' language: - iso: ger month: '09' oa: 1 oa_version: Published Version publication_identifier: eisbn: - 9-783-1102-7873-6 isbn: - ' 978-3-11-027634-3' issn: - 2191-3587 publication_status: published publisher: De Gruyter publist_id: '4621' pubrep_id: '725' quality_controlled: '1' status: public title: (Open) Linked Data in Bibliotheken 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: book user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 50 year: '2013' ... --- _id: '2301' abstract: - lang: eng text: We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P. author: - first_name: Ankush full_name: Desai, Ankush last_name: Desai - first_name: Vivek full_name: Gupta, Vivek last_name: Gupta - first_name: Ethan full_name: Jackson, Ethan last_name: Jackson - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer - first_name: Sriram full_name: Rajamani, Sriram last_name: Rajamani - first_name: Damien full_name: Zufferey, Damien id: 4397AC76-F248-11E8-B48F-1D18A9856A87 last_name: Zufferey orcid: 0000-0002-3197-8736 citation: ama: 'Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184' apa: 'Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184' chicago: 'Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.' ieee: 'A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, WA, United States, 2013, pp. 321–331.' ista: 'Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.' mla: 'Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.' short: A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331. conference: end_date: 2013-06-19 location: Seattle, WA, United States name: 'PLDI: Programming Languages Design and Implementation' start_date: 2013-06-16 date_created: 2018-12-11T11:56:52Z date_published: 2013-06-01T00:00:00Z date_updated: 2021-01-12T06:56:38Z day: '01' department: - _id: ToHe doi: 10.1145/2491956.2462184 ec_funded: 1 language: - iso: eng main_file_link: - url: http://research.microsoft.com/pubs/191069/pldi212_desai.pdf month: '06' oa_version: None page: 321 - 331 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation publication_status: published publisher: ACM publist_id: '4626' quality_controlled: '1' scopus_import: 1 status: public title: 'P: Safe asynchronous event-driven programming' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2300' abstract: - lang: eng text: We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability. article_number: '064401' author: - first_name: Alessandro full_name: Giuliani, Alessandro last_name: Giuliani - first_name: Élliott full_name: Lieb, Élliott last_name: Lieb - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401 apa: Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.88.064401 chicago: Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401. ieee: A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” Physical Review B, vol. 88, no. 6. American Physical Society, 2013. ista: Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401. mla: Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:10.1103/PhysRevB.88.064401. short: A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013). date_created: 2018-12-11T11:56:51Z date_published: 2013-08-01T00:00:00Z date_updated: 2021-01-12T06:56:38Z day: '01' department: - _id: RoSe doi: 10.1103/PhysRevB.88.064401 external_id: arxiv: - '1305.5323' intvolume: ' 88' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1305.5323 month: '08' oa: 1 oa_version: Preprint publication: Physical Review B publication_status: published publisher: American Physical Society publist_id: '4627' quality_controlled: '1' scopus_import: 1 status: public title: Realization of stripes and slabs in two and three dimensions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 88 year: '2013' ... --- _id: '2303' abstract: - lang: eng text: MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools. acknowledgement: This work was supported by IST Austria institutional funds. article_type: review author: - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6 apa: Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6 chicago: Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013. https://doi.org/10.1007/s11515-013-1279-6. ieee: S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer, pp. 557–568, 2013. ista: Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568. mla: Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:10.1007/s11515-013-1279-6. short: S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568. date_created: 2018-12-11T11:56:52Z date_published: 2013-09-03T00:00:00Z date_updated: 2021-01-12T06:56:39Z day: '03' department: - _id: SiHi doi: 10.1007/s11515-013-1279-6 intvolume: ' 8' issue: '6' language: - iso: eng month: '09' oa_version: None page: 557 - 568 publication: Frontiers in Biology publication_status: published publisher: Springer publist_id: '4624' quality_controlled: '1' scopus_import: 1 status: public title: Dissection of gene function at clonal level using mosaic analysis with double markers type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2013' ... --- _id: '2304' abstract: - lang: eng text: This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter. acknowledgement: This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria). author: - first_name: Florian full_name: Pausinger, Florian id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87 last_name: Pausinger orcid: 0000-0002-8379-3768 citation: ama: Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008 apa: Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008 chicago: Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008. ieee: F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013. ista: Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50. mla: Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008. short: F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50. date_created: 2018-12-11T11:56:53Z date_published: 2013-09-05T00:00:00Z date_updated: 2021-01-12T06:56:39Z day: '05' department: - _id: HeEd doi: 10.1016/j.endm.2013.07.008 intvolume: ' 43' language: - iso: eng month: '09' oa_version: None page: 43 - 50 publication: Electronic Notes in Discrete Mathematics publication_status: published publisher: Elsevier publist_id: '4623' quality_controlled: '1' scopus_import: 1 status: public title: Van der Corput sequences and linear permutations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2013' ... --- _id: '2315' abstract: - lang: eng text: ' We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. ' article_processing_charge: No author: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jakob full_name: Yngvason, Jakob last_name: Yngvason - first_name: Valentin full_name: Zagrebnov, Valentin last_name: Zagrebnov citation: ama: 'Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063' apa: 'Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063' chicago: Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. https://doi.org/10.1142/9789814449243_0063. ieee: 'R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619.' ista: 'Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619.' mla: Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction. World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063. short: R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619. conference: name: 'ICMP: International Congress on Mathematical Physics' date_created: 2018-12-11T11:56:57Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:56:43Z doi: 10.1142/9789814449243_0063 extern: '1' external_id: arxiv: - '1209.4046' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1209.4046 oa: 1 oa_version: None page: 610-619 publication_status: published publisher: World Scientific Publishing publist_id: '4612' status: public title: Disordered Bose-Einstein condensates with interaction type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2319' abstract: - lang: eng text: In a recent paper [7] we give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer (BCS)model. Here we present our results in the simplified case of a one-dimensional system of particles interacting via a δ-potential. author: - first_name: Rupert full_name: Frank, Rupert L last_name: Frank - first_name: Christian full_name: Hainzl, Christian last_name: Hainzl - first_name: Robert full_name: Robert Seiringer id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jan full_name: Solovej, Jan P last_name: Solovej citation: ama: 'Frank R, Hainzl C, Seiringer R, Solovej J. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88. doi:10.1007/978-3-0348-0531-5_3' apa: 'Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2013). Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction (pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. https://doi.org/10.1007/978-3-0348-0531-5_3' chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,” 57–88. Springer, 2013. https://doi.org/10.1007/978-3-0348-0531-5_3. ieee: 'R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.' ista: 'Frank R, Hainzl C, Seiringer R, Solovej J. 2013. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. OTAMP: Operator Theory, Analysis and Mathematical Physics, 57–88.' mla: Frank, Rupert, et al. Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction. Springer, 2013, pp. 57–88, doi:10.1007/978-3-0348-0531-5_3. short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88. conference: name: 'OTAMP: Operator Theory, Analysis and Mathematical Physics' date_created: 2018-12-11T11:56:58Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:56:45Z day: '01' doi: 10.1007/978-3-0348-0531-5_3 extern: 1 main_file_link: - open_access: '1' url: http://arxiv.org/abs/1103.1866 month: '01' oa: 1 page: 57 - 88 publication_status: published publisher: Springer publist_id: '4608' quality_controlled: 0 status: public title: ' Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction' type: conference year: '2013' ... --- _id: '2328' abstract: - lang: eng text: "Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof." alternative_title: - LNCS 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: Ali full_name: Sezgin, Ali id: 4C7638DA-F248-11E8-B48F-1D18A9856A87 last_name: Sezgin - first_name: Viktor full_name: Vafeiadis, Viktor last_name: Vafeiadis citation: ama: Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18 apa: 'Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18' chicago: Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18. ieee: T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013. ista: Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256. mla: Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18. short: T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256. conference: end_date: 2013-08-30 location: Buenos Aires, Argentina name: 'CONCUR: Concurrency Theory' start_date: 2013-08-27 date_created: 2018-12-11T11:57:01Z date_published: 2013-08-01T00:00:00Z date_updated: 2023-02-23T10:16:27Z day: '01' ddc: - '000' - '004' department: - _id: ToHe doi: 10.1007/978-3-642-40184-8_18 ec_funded: 1 file: - access_level: open_access checksum: bdbb520de91751fe0136309ad4ef67e4 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:58Z date_updated: 2020-07-14T12:45:39Z file_id: '4721' file_name: IST-2014-197-v1+1_main-queue-verification.pdf file_size: 337059 relation: main_file file_date_updated: 2020-07-14T12:45:39Z has_accepted_license: '1' intvolume: ' 8052' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 242 - 256 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '4598' pubrep_id: '197' quality_controlled: '1' related_material: record: - id: '1832' relation: later_version status: public scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Aspect-oriented linearizability proofs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8052 year: '2013' ... --- _id: '2404' abstract: - lang: eng text: The Lieb-Thirring inequalities give a bound on the negative eigenvalues of a Schrödinger operator in terms of an Lp-norm of the potential. These are dual to bounds on the H1-norms of a system of orthonormal functions. Here we extend these bounds to analogous inequalities for perturbations of the Fermi sea of noninteracting particles (i.e., for perturbations of the continuous spectrum of the Laplacian by local potentials). author: - first_name: Rupert full_name: Frank, Rupert L last_name: Frank - first_name: Mathieu full_name: Lewin, Mathieu last_name: Lewin - first_name: Élliott full_name: Lieb, Élliott H last_name: Lieb - first_name: Robert full_name: Robert Seiringer id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Frank R, Lewin M, Lieb É, Seiringer R. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 2013;162(3):435-495. doi:10.1215/00127094-2019477 apa: Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2013). A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2019477 chicago: Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal. Duke University Press, 2013. https://doi.org/10.1215/00127094-2019477. ieee: R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “A positive density analogue of the Lieb-Thirring inequality,” Duke Mathematical Journal, vol. 162, no. 3. Duke University Press, pp. 435–495, 2013. ista: Frank R, Lewin M, Lieb É, Seiringer R. 2013. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 162(3), 435–495. mla: Frank, Rupert, et al. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal, vol. 162, no. 3, Duke University Press, 2013, pp. 435–95, doi:10.1215/00127094-2019477. short: R. Frank, M. Lewin, É. Lieb, R. Seiringer, Duke Mathematical Journal 162 (2013) 435–495. date_created: 2018-12-11T11:57:28Z date_published: 2013-02-01T00:00:00Z date_updated: 2021-01-12T06:57:17Z day: '01' doi: 10.1215/00127094-2019477 extern: 1 intvolume: ' 162' issue: '3' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1108.4246 month: '02' oa: 1 page: 435 - 495 publication: Duke Mathematical Journal publication_status: published publisher: Duke University Press publist_id: '4521' quality_controlled: 0 status: public title: A positive density analogue of the Lieb-Thirring inequality type: journal_article volume: 162 year: '2013' ... --- _id: '2406' abstract: - lang: eng text: We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval. We prove that, in the Gross-Pitaevskii limit, Bose Einstein condensation takes place in the whole parameter range considered. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the unit interval. author: - first_name: Robert full_name: Robert Seiringer id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jakob full_name: Yngvason, Jakob last_name: Yngvason - first_name: Valentin full_name: Zagrebnov, Valentin A last_name: Zagrebnov citation: ama: 'Seiringer R, Yngvason J, Zagrebnov V. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 2013;217(1):103-107. doi:10.1140/epjst/e2013-01759-5' apa: 'Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. Springer. https://doi.org/10.1140/epjst/e2013-01759-5' chicago: 'Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics. Springer, 2013. https://doi.org/10.1140/epjst/e2013-01759-5.' ieee: 'R. Seiringer, J. Yngvason, and V. Zagrebnov, “Condensation of interacting bosons in a random potential,” European Physical Journal: Special Topics, vol. 217, no. 1. Springer, pp. 103–107, 2013.' ista: 'Seiringer R, Yngvason J, Zagrebnov V. 2013. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 217(1), 103–107.' mla: 'Seiringer, Robert, et al. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics, vol. 217, no. 1, Springer, 2013, pp. 103–07, doi:10.1140/epjst/e2013-01759-5.' short: 'R. Seiringer, J. Yngvason, V. Zagrebnov, European Physical Journal: Special Topics 217 (2013) 103–107.' date_created: 2018-12-11T11:57:29Z date_published: 2013-02-01T00:00:00Z date_updated: 2021-01-12T06:57:17Z day: '01' doi: 10.1140/epjst/e2013-01759-5 extern: 1 intvolume: ' 217' issue: '1' month: '02' page: 103 - 107 publication: 'European Physical Journal: Special Topics' publication_status: published publisher: Springer publist_id: '4520' quality_controlled: 0 status: public title: Condensation of interacting bosons in a random potential type: journal_article volume: 217 year: '2013' ... --- _id: '2405' abstract: - lang: eng text: We consider the bipolaron in the Pekar-Tomasevich approximation and address the question whether the ground state is spherically symmetric or not. Numerical analysis has, so far, not completely settled the question. Our contribution is to prove rigorously that the ground state remains spherical for small values of the electron-electron Coulomb repulsion. author: - first_name: Rupert full_name: Frank, Rupert L last_name: Frank - first_name: Élliott full_name: Lieb, Élliott H last_name: Lieb - first_name: Robert full_name: Robert Seiringer id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Frank R, Lieb É, Seiringer R. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 2013;319(2):557-573. doi:10.1007/s00220-012-1604-y apa: Frank, R., Lieb, É., & Seiringer, R. (2013). Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1604-y chicago: Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-012-1604-y. ieee: R. Frank, É. Lieb, and R. Seiringer, “Symmetry of bipolaron bound states for small Coulomb repulsion,” Communications in Mathematical Physics, vol. 319, no. 2. Springer, pp. 557–573, 2013. ista: Frank R, Lieb É, Seiringer R. 2013. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 319(2), 557–573. mla: Frank, Rupert, et al. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics, vol. 319, no. 2, Springer, 2013, pp. 557–73, doi:10.1007/s00220-012-1604-y. short: R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 319 (2013) 557–573. date_created: 2018-12-11T11:57:28Z date_published: 2013-04-01T00:00:00Z date_updated: 2021-01-12T06:57:17Z day: '01' doi: 10.1007/s00220-012-1604-y extern: 1 intvolume: ' 319' issue: '2' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1201.3954 month: '04' oa: 1 page: 557 - 573 publication: Communications in Mathematical Physics publication_status: published publisher: Springer publist_id: '4522' quality_controlled: 0 status: public title: Symmetry of bipolaron bound states for small Coulomb repulsion type: journal_article volume: 319 year: '2013' ... --- _id: '2408' abstract: - lang: eng text: We investigate the low-energy excitation spectrum of a Bose gas confined in a trap, with weak long-range repulsive interactions. In particular, we prove that the spectrum can be described in terms of the eigenvalues of an effective one-particle operator, as predicted by the Bogoliubov approximation. author: - first_name: Philip full_name: Grech, Philip last_name: Grech - first_name: Robert full_name: Robert Seiringer id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Grech P, Seiringer R. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 2013;322(2):559-591. doi:10.1007/s00220-013-1736-8 apa: Grech, P., & Seiringer, R. (2013). The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1736-8 chicago: Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1736-8. ieee: P. Grech and R. Seiringer, “The excitation spectrum for weakly interacting Bosons in a trap,” Communications in Mathematical Physics, vol. 322, no. 2. Springer, pp. 559–591, 2013. ista: Grech P, Seiringer R. 2013. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 322(2), 559–591. mla: Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics, vol. 322, no. 2, Springer, 2013, pp. 559–91, doi:10.1007/s00220-013-1736-8. short: P. Grech, R. Seiringer, Communications in Mathematical Physics 322 (2013) 559–591. date_created: 2018-12-11T11:57:29Z date_published: 2013-09-01T00:00:00Z date_updated: 2021-01-12T06:57:18Z day: '01' doi: 10.1007/s00220-013-1736-8 extern: 1 intvolume: ' 322' issue: '2' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1205.5259 month: '09' oa: 1 page: 559 - 591 publication: Communications in Mathematical Physics publication_status: published publisher: Springer publist_id: '4518' quality_controlled: 0 status: public title: The excitation spectrum for weakly interacting Bosons in a trap type: journal_article volume: 322 year: '2013' ... --- _id: '2412' abstract: - lang: eng text: 'Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates.' author: - first_name: Anne full_name: Kupczok, Anne id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87 last_name: Kupczok - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 citation: ama: Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 2013;13(1):54-54. doi:10.1186/1471-2148-13-54 apa: Kupczok, A., & Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-54 chicago: Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-54. ieee: A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013. ista: Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54. mla: Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:10.1186/1471-2148-13-54. short: A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54. date_created: 2018-12-11T11:57:31Z date_published: 2013-02-26T00:00:00Z date_updated: 2021-01-12T06:57:20Z day: '26' ddc: - '576' department: - _id: JoBo doi: 10.1186/1471-2148-13-54 file: - access_level: open_access checksum: 029c7e0b198c19312b66ecce3cabb22f content_type: application/pdf creator: system date_created: 2018-12-12T10:17:15Z date_updated: 2020-07-14T12:45:40Z file_id: '5268' file_name: IST-2015-397-v1+1_1471-2148-13-54.pdf file_size: 518729 relation: main_file file_date_updated: 2020-07-14T12:45:40Z has_accepted_license: '1' intvolume: ' 13' issue: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 54 - 54 publication: BMC Evolutionary Biology publication_status: published publisher: BioMed Central publist_id: '4514' pubrep_id: '397' quality_controlled: '1' scopus_import: 1 status: public title: 'Probabilistic models for CRISPR spacer content 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2013' ... --- _id: '2413' abstract: - lang: eng text: 'Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness.' alternative_title: - Reviews of Nonlinear Dynamics and Complexity author: - first_name: Mario full_name: Valderrama, Mario last_name: Valderrama - first_name: Vicente full_name: Botella Soler, Vicente id: 421234E8-F248-11E8-B48F-1D18A9856A87 last_name: Botella Soler orcid: 0000-0002-8790-1914 - first_name: Michel full_name: Le Van Quyen, Michel last_name: Le Van Quyen citation: ama: 'Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH; 2013. doi:10.1002/9783527671632.ch08' apa: 'Valderrama, M., Botella Soler, V., & Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer & Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH. https://doi.org/10.1002/9783527671632.ch08' chicago: 'Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson. Wiley-VCH, 2013. https://doi.org/10.1002/9783527671632.ch08.' ieee: 'M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, M. Meyer and Z. Pesenson, Eds. Wiley-VCH, 2013.' ista: 'Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, .' mla: 'Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson, Wiley-VCH, 2013, doi:10.1002/9783527671632.ch08.' short: 'M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley-VCH, 2013.' date_created: 2018-12-11T11:57:31Z date_published: 2013-08-01T00:00:00Z date_updated: 2021-01-12T06:57:20Z day: '01' department: - _id: GaTk doi: 10.1002/9783527671632.ch08 editor: - first_name: Misha full_name: Meyer, Misha last_name: Meyer - first_name: Z. full_name: Pesenson, Z. last_name: Pesenson language: - iso: eng month: '08' oa_version: None publication: 'Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain' publication_identifier: eisbn: - '9783527671632' isbn: - '9783527411986 ' publication_status: published publisher: Wiley-VCH publist_id: '4513' quality_controlled: '1' scopus_import: 1 status: public title: 'Neuronal oscillations scale up and scale down the brain dynamics ' type: book_chapter user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2410' abstract: - lang: eng text: 'Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. ' author: - first_name: Rodrigo A full_name: Fernandes Redondo, Rodrigo A id: 409D5C96-F248-11E8-B48F-1D18A9856A87 last_name: Fernandes Redondo orcid: 0000-0002-5837-2793 - first_name: Anne full_name: Kupczok, Anne id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87 last_name: Kupczok - first_name: Gertraud full_name: Stift, Gertraud id: 2DB195CA-F248-11E8-B48F-1D18A9856A87 last_name: Stift - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 citation: ama: Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 2013;1(3). doi:10.1128/genomeA.00216-13 apa: Fernandes Redondo, R. A., Kupczok, A., Stift, G., & Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. American Society for Microbiology. https://doi.org/10.1128/genomeA.00216-13 chicago: Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements. American Society for Microbiology, 2013. https://doi.org/10.1128/genomeA.00216-13. ieee: R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” Genome Announcements, vol. 1, no. 3. American Society for Microbiology, 2013. ista: Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3). mla: Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements, vol. 1, no. 3, American Society for Microbiology, 2013, doi:10.1128/genomeA.00216-13. short: R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013). date_created: 2018-12-11T11:57:30Z date_published: 2013-06-13T00:00:00Z date_updated: 2021-01-12T06:57:19Z day: '13' ddc: - '576' department: - _id: JoBo - _id: LifeSc doi: 10.1128/genomeA.00216-13 file: - access_level: open_access checksum: 0751ec74b695567e0cdf02aaf9c26829 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:36Z date_updated: 2020-07-14T12:45:40Z file_id: '5291' file_name: IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf file_size: 130026 relation: main_file file_date_updated: 2020-07-14T12:45:40Z has_accepted_license: '1' intvolume: ' 1' issue: '3' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Genome Announcements publication_status: published publisher: American Society for Microbiology publist_id: '4516' pubrep_id: '398' quality_controlled: '1' scopus_import: 1 status: public title: Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1 year: '2013' ... --- _id: '2447' abstract: - lang: eng text: "Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n" alternative_title: - LNCS article_processing_charge: No author: - first_name: Ruzica full_name: Piskac, Ruzica last_name: Piskac - first_name: Thomas full_name: Wies, Thomas id: 447BFB88-F248-11E8-B48F-1D18A9856A87 last_name: Wies - first_name: Damien full_name: Zufferey, Damien id: 4397AC76-F248-11E8-B48F-1D18A9856A87 last_name: Zufferey orcid: 0000-0002-3197-8736 citation: ama: Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54 apa: 'Piskac, R., Wies, T., & Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_54' chicago: Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54. ieee: R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013. ista: Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789. mla: Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54. short: R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789. conference: end_date: 2013-07-19 location: St. Petersburg, Russia name: 'CAV: Computer Aided Verification' start_date: 2013-07-13 date_created: 2018-12-11T11:57:43Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:47Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-39799-8_54 file: - access_level: open_access checksum: 2e866932ab688f47ecd504acb4d5c7d4 content_type: application/pdf creator: dernst date_created: 2020-05-15T11:13:01Z date_updated: 2020-07-14T12:45:41Z file_id: '7859' file_name: 2013_CAV_Piskac.pdf file_size: 309182 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 8044' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 773 - 789 publication_status: published publisher: Springer publist_id: '4456' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Automating separation logic using SMT type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8044 year: '2013' ... --- _id: '2443' abstract: - lang: eng text: The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery. acknowledgement: The authors thank Dr Christian Luschnig (University of Natural Resources and Life Sciences (BOKU), Vienna, Austria) for the anti-PIN2 antibody, Professor Mark Estelle (University of California, San Diego, CA, USA) for tir1-1 mutant seeds and, last but not least, to Dr David Morris for critical reading of the manuscript. We also thank Markéta Pařezová and Jana Stýblová for excellent technical assistance. This work was supported by the Grant Agency of the Czech Republic (P305/11/0797 to E.Z. and 13-40637S to J.F.), the Central European Institute of Technology project CZ.1.05/1.1.00/02.0068 from the European Regional Development Fund and by a European Research Council starting independent research grant ERC-2011-StG-20101109-PSDP (to J.F.). article_processing_charge: No article_type: original author: - first_name: Sibu full_name: Simon, Sibu id: 4542EF9A-F248-11E8-B48F-1D18A9856A87 last_name: Simon orcid: 0000-0002-1998-6741 - first_name: Martin full_name: Kubeš, Martin last_name: Kubeš - first_name: Pawel full_name: Baster, Pawel id: 3028BD74-F248-11E8-B48F-1D18A9856A87 last_name: Baster - first_name: Stéphanie full_name: Robert, Stéphanie last_name: Robert - first_name: Petre full_name: Dobrev, Petre last_name: Dobrev - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Jan full_name: Petrášek, Jan last_name: Petrášek - first_name: Eva full_name: Zažímalová, Eva last_name: Zažímalová citation: ama: 'Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 2013;200(4):1034-1048. doi:10.1111/nph.12437' apa: 'Simon, S., Kubeš, M., Baster, P., Robert, S., Dobrev, P., Friml, J., … Zažímalová, E. (2013). Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. Wiley. https://doi.org/10.1111/nph.12437' chicago: 'Simon, Sibu, Martin Kubeš, Pawel Baster, Stéphanie Robert, Petre Dobrev, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist. Wiley, 2013. https://doi.org/10.1111/nph.12437.' ieee: 'S. Simon et al., “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” New Phytologist, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.' ista: 'Simon S, Kubeš M, Baster P, Robert S, Dobrev P, Friml J, Petrášek J, Zažímalová E. 2013. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 200(4), 1034–1048.' mla: 'Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:10.1111/nph.12437.' short: S. Simon, M. Kubeš, P. Baster, S. Robert, P. Dobrev, J. Friml, J. Petrášek, E. Zažímalová, New Phytologist 200 (2013) 1034–1048. date_created: 2018-12-11T11:57:41Z date_published: 2013-12-01T00:00:00Z date_updated: 2022-06-07T08:57:52Z day: '01' department: - _id: JiFr doi: 10.1111/nph.12437 ec_funded: 1 intvolume: ' 200' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1111/nph.12437 month: '12' oa: 1 oa_version: Published Version page: 1034 - 1048 project: - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants publication: New Phytologist publication_status: published publisher: Wiley publist_id: '4460' quality_controlled: '1' scopus_import: '1' status: public title: 'Defining the selectivity of processes along the auxin response chain: A study using auxin analogues' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 200 year: '2013' ... --- _id: '2446' abstract: - lang: eng text: The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements. 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: Andreas full_name: Gaiser, Andreas last_name: Gaiser - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 citation: ama: Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:10.1007/978-3-642-39799-8_37 apa: 'Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37' chicago: Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37. ieee: K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013. ista: Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575. mla: Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37. short: K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575. conference: end_date: 2013-07-19 location: St. Petersburg, Russia name: 'CAV: Computer Aided Verification' start_date: 2013-07-13 date_created: 2018-12-11T11:57:42Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:47Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-39799-8_37 ec_funded: 1 external_id: arxiv: - '1304.5281' intvolume: ' 8044' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1304.5281 month: '07' oa: 1 oa_version: Preprint page: 559 - 575 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_status: published publisher: Springer publist_id: '4457' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8044 year: '2013' ... --- _id: '2444' abstract: - lang: eng text: 'We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time.' 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: Jakub full_name: Ła̧Cki, Jakub last_name: Ła̧Cki citation: ama: Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:10.1007/978-3-642-39799-8_36 apa: 'Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36' chicago: Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36. ieee: K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013. ista: Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558. mla: Chatterjee, Krishnendu, and Jakub Ła̧Cki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36. short: K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558. conference: end_date: 2013-07-19 location: St. Petersburg, Russia name: 'CAV: Computer Aided Verification' start_date: 2013-07-13 date_created: 2018-12-11T11:57:42Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:47Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-39799-8_36 ec_funded: 1 external_id: arxiv: - '1304.0084' intvolume: ' 8044' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1304.0084 month: '07' oa: 1 oa_version: Preprint page: 543 - 558 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_status: published publisher: Springer publist_id: '4459' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Faster algorithms for Markov decision processes with low treewidth type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8044 year: '2013' ... --- _id: '2449' abstract: - lang: eng text: 'Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. ' author: - first_name: Tomasz full_name: Nodzyński, Tomasz last_name: Nodzyński - first_name: Murguel full_name: Feraru, Murguel last_name: Feraru - first_name: Sibylle full_name: Hirsch, Sibylle last_name: Hirsch - first_name: Riet full_name: De Rycke, Riet last_name: De Rycke - first_name: Claudiu full_name: Nicuales, Claudiu last_name: Nicuales - first_name: Jelle full_name: Van Leene, Jelle last_name: Van Leene - first_name: Geert full_name: De Jaeger, Geert last_name: De Jaeger - first_name: Steffen full_name: Vanneste, Steffen last_name: Vanneste - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 2013;6(6):1849-1862. doi:10.1093/mp/sst044 apa: Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. Cell Press. https://doi.org/10.1093/mp/sst044 chicago: Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant. Cell Press, 2013. https://doi.org/10.1093/mp/sst044. ieee: T. Nodzyński et al., “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” Molecular Plant, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013. ista: Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862. mla: Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:10.1093/mp/sst044. short: T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862. date_created: 2018-12-11T11:57:44Z date_published: 2013-11-01T00:00:00Z date_updated: 2021-01-12T06:57:33Z day: '01' department: - _id: JiFr doi: 10.1093/mp/sst044 intvolume: ' 6' issue: '6' language: - iso: eng month: '11' oa_version: None page: 1849 - 1862 publication: Molecular Plant publication_status: published publisher: Cell Press publist_id: '4454' quality_controlled: '1' scopus_import: 1 status: public title: Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2013' ... --- _id: '2452' abstract: - lang: eng text: 'Background: Abundance and distribution of the plant hormone auxin play important roles in plant development. Besides other metabolic processes, various auxin carriers control the cellular level of active auxin and, hence, are major regulators of cellular auxin homeostasis. Despite the developmental importance of auxin transporters, a simple medium-to-high throughput approach to assess carrier activities is still missing. Here we show that carrier driven depletion of cellular auxin correlates with reduced nuclear auxin signaling in tobacco Bright Yellow-2 (BY-2) cell cultures.Results: We developed an easy to use transient single-cell-based system to detect carrier activity. We use the relative changes in signaling output of the auxin responsive promoter element DR5 to indirectly visualize auxin carrier activity. The feasibility of the transient approach was demonstrated by pharmacological and genetic interference with auxin signaling and transport. As a proof of concept, we provide visual evidence that the prominent auxin transport proteins PIN-FORMED (PIN)2 and PIN5 regulate cellular auxin homeostasis at the plasma membrane and endoplasmic reticulum (ER), respectively. Our data suggest that PIN2 and PIN5 have different sensitivities to the auxin transport inhibitor 1-naphthylphthalamic acid (NPA). Also the putative PIN-LIKES (PILS) auxin carrier activity at the ER is insensitive to NPA in our system, indicating that NPA blocks intercellular, but not intracellular auxin transport.Conclusions: This single-cell-based system is a useful tool by which the activity of putative auxin carriers, such as PINs, PILS and WALLS ARE THIN1 (WAT1), can be indirectly visualized in a medium-to-high throughput manner. Moreover, our single cell system might be useful to investigate also other hormonal signaling pathways, such as cytokinin.' author: - first_name: Elke full_name: Barbez, Elke last_name: Barbez - first_name: Martina full_name: Laňková, Martina last_name: Laňková - first_name: Markéta full_name: Pařezová, Markéta last_name: Pařezová - first_name: Alexis full_name: Maizel, Alexis last_name: Maizel - first_name: Eva full_name: Zažímalová, Eva last_name: Zažímalová - first_name: Jan full_name: Petrášek, Jan last_name: Petrášek - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Jürgen full_name: Kleine-Vehn, Jürgen last_name: Kleine Vehn citation: ama: Barbez E, Laňková M, Pařezová M, et al. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 2013;13(1). doi:10.1186/1471-2229-13-20 apa: Barbez, E., Laňková, M., Pařezová, M., Maizel, A., Zažímalová, E., Petrášek, J., … Kleine Vehn, J. (2013). Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-13-20 chicago: Barbez, Elke, Martina Laňková, Markéta Pařezová, Alexis Maizel, Eva Zažímalová, Jan Petrášek, Jiří Friml, and Jürgen Kleine Vehn. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2229-13-20. ieee: E. Barbez et al., “Single-cell-based system to monitor carrier driven cellular auxin homeostasis,” BMC Plant Biology, vol. 13, no. 1. BioMed Central, 2013. ista: Barbez E, Laňková M, Pařezová M, Maizel A, Zažímalová E, Petrášek J, Friml J, Kleine Vehn J. 2013. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 13(1). mla: Barbez, Elke, et al. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology, vol. 13, no. 1, BioMed Central, 2013, doi:10.1186/1471-2229-13-20. short: E. Barbez, M. Laňková, M. Pařezová, A. Maizel, E. Zažímalová, J. Petrášek, J. Friml, J. Kleine Vehn, BMC Plant Biology 13 (2013). date_created: 2018-12-11T11:57:45Z date_published: 2013-02-01T00:00:00Z date_updated: 2021-01-12T06:57:34Z day: '01' doi: 10.1186/1471-2229-13-20 extern: 1 intvolume: ' 13' issue: '1' month: '02' publication: BMC Plant Biology publication_status: published publisher: BioMed Central publist_id: '4451' quality_controlled: 0 status: public title: Single-cell-based system to monitor carrier driven cellular auxin homeostasis type: journal_article volume: 13 year: '2013' ... --- _id: '2450' abstract: - lang: eng text: 'Understanding how hormones and genes interact to coordinate plant growth is a major challenge in developmental biology. The activities of auxin, ethylene, and cytokinin depend on cellular context and exhibit either synergistic or antagonistic interactions. Here we use experimentation and network construction to elucidate the role of the interaction of the POLARIS peptide (PLS) and the auxin efflux carrier PIN proteins in the crosstalk of three hormones (auxin, ethylene, and cytokinin) in Arabidopsis root development. In ethylene hypersignaling mutants such as polaris (pls), we show experimentally that expression of both PIN1 and PIN2 significantly increases. This relationship is analyzed in the context of the crosstalk between auxin, ethylene, and cytokinin: in pls, endogenous auxin, ethylene and cytokinin concentration decreases, approximately remains unchanged and increases, respectively. Experimental data are integrated into a hormonal crosstalk network through combination with information in literature. Network construction reveals that the regulation of both PIN1 and PIN2 is predominantly via ethylene signaling. In addition, it is deduced that the relationship between cytokinin and PIN1 and PIN2 levels implies a regulatory role of cytokinin in addition to its regulation to auxin, ethylene, and PLS levels. We discuss how the network of hormones and genes coordinates plant growth by simultaneously regulating the activities of auxin, ethylene, and cytokinin signaling pathways.hormonal crosstalk, root development, auxin flux, PIN proteins, PLS protein, signaling network' author: - first_name: Junli full_name: Liu, Junli last_name: Liu - first_name: Saher full_name: Menhi, Saher last_name: Menhi - first_name: Jennifer full_name: Topping, Jennifer last_name: Topping - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Keith full_name: Lindsey, Keith last_name: Lindsey citation: ama: Liu J, Menhi S, Topping J, Friml J, Lindsey K. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. 2013;4(75). doi:10.3389/fpls.2013.00075 apa: Liu, J., Menhi, S., Topping, J., Friml, J., & Lindsey, K. (2013). Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. Frontiers Research Foundation. https://doi.org/10.3389/fpls.2013.00075 chicago: Liu, Junli, Saher Menhi, Jennifer Topping, Jiří Friml, and Keith Lindsey. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” Frontiers in Plant Science. Frontiers Research Foundation, 2013. https://doi.org/10.3389/fpls.2013.00075. ieee: J. Liu, S. Menhi, J. Topping, J. Friml, and K. Lindsey, “Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development,” Frontiers in Plant Science, vol. 4, no. 75. Frontiers Research Foundation, 2013. ista: Liu J, Menhi S, Topping J, Friml J, Lindsey K. 2013. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. 4(75). mla: Liu, Junli, et al. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” Frontiers in Plant Science, vol. 4, no. 75, Frontiers Research Foundation, 2013, doi:10.3389/fpls.2013.00075. short: J. Liu, S. Menhi, J. Topping, J. Friml, K. Lindsey, Frontiers in Plant Science 4 (2013). date_created: 2018-12-11T11:57:44Z date_published: 2013-04-01T00:00:00Z date_updated: 2021-01-12T06:57:34Z day: '01' doi: 10.3389/fpls.2013.00075 extern: 1 intvolume: ' 4' issue: '75' month: '04' publication: Frontiers in Plant Science publication_status: published publisher: Frontiers Research Foundation publist_id: '4453' quality_controlled: 0 status: public title: Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development type: journal_article volume: 4 year: '2013' ... --- _id: '245' abstract: - lang: eng text: For given non-zero integers a, b, q we investigate the density of solutions (x; y) ∈ ℤ2 to the binary cubic congruence ax2 + by3 ≡ 0 mod q, and use it to establish the Manin conjecture for a singular del Pezzo surface of degree 2 defined over ℚ. author: - first_name: Stephan full_name: Baier, Stephan last_name: Baier - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: Baier S, Browning TD. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. 2013;(680):69-151. doi:10.1515/crelle.2012.039 apa: Baier, S., & Browning, T. D. (2013). Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle.2012.039 chicago: Baier, Stephan, and Timothy D Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, 2013. https://doi.org/10.1515/crelle.2012.039. ieee: S. Baier and T. D. Browning, “Inhomogeneous cubic congruences and rational points on del Pezzo surfaces,” Journal fur die Reine und Angewandte Mathematik, no. 680. Walter de Gruyter, pp. 69–151, 2013. ista: Baier S, Browning TD. 2013. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. (680), 69–151. mla: Baier, Stephan, and Timothy D. Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” Journal Fur Die Reine Und Angewandte Mathematik, no. 680, Walter de Gruyter, 2013, pp. 69–151, doi:10.1515/crelle.2012.039. short: S. Baier, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik (2013) 69–151. date_created: 2018-12-11T11:45:24Z date_published: 2013-07-01T00:00:00Z date_updated: 2021-01-12T06:57:33Z day: '01' doi: 10.1515/crelle.2012.039 extern: 1 issue: '680' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1011.3434 month: '07' oa: 1 page: 69 - 151 publication: Journal fur die Reine und Angewandte Mathematik publication_status: published publisher: Walter de Gruyter publist_id: '7659' quality_controlled: 0 status: public title: Inhomogeneous cubic congruences and rational points on del Pezzo surfaces type: journal_article year: '2013' ... --- _id: '2457' author: - first_name: Tom full_name: Viaene, Tom last_name: Viaene - first_name: Charles full_name: Delwiche, Charles last_name: Delwiche - first_name: Stefan full_name: Rensing, Stefan last_name: Rensing - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Viaene T, Delwiche C, Rensing S, Friml J. Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. 2013;18(1):5-10. doi:10.1016/j.tplants.2012.08.009 apa: Viaene, T., Delwiche, C., Rensing, S., & Friml, J. (2013). Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. Cell Press. https://doi.org/10.1016/j.tplants.2012.08.009 chicago: Viaene, Tom, Charles Delwiche, Stefan Rensing, and Jiří Friml. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” Trends in Plant Science. Cell Press, 2013. https://doi.org/10.1016/j.tplants.2012.08.009. ieee: T. Viaene, C. Delwiche, S. Rensing, and J. Friml, “Origin and evolution of PIN auxin transporters in the green lineage,” Trends in Plant Science, vol. 18, no. 1. Cell Press, pp. 5–10, 2013. ista: Viaene T, Delwiche C, Rensing S, Friml J. 2013. Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. 18(1), 5–10. mla: Viaene, Tom, et al. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” Trends in Plant Science, vol. 18, no. 1, Cell Press, 2013, pp. 5–10, doi:10.1016/j.tplants.2012.08.009. short: T. Viaene, C. Delwiche, S. Rensing, J. Friml, Trends in Plant Science 18 (2013) 5–10. date_created: 2018-12-11T11:57:46Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:57:36Z day: '01' doi: 10.1016/j.tplants.2012.08.009 extern: '1' intvolume: ' 18' issue: '1' language: - iso: eng month: '01' oa_version: None page: 5 - 10 publication: Trends in Plant Science publication_status: published publisher: Cell Press publist_id: '4446' quality_controlled: '1' status: public title: Origin and evolution of PIN auxin transporters in the green lineage type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2013' ... --- _id: '246' abstract: - lang: eng text: Given an intersection of two quadrics X Pm1, with m > 9, the quantitative arithmetic of the set X(Q) is investigated under the assumption that the singular locus of X consists of a pair of conjugate singular points defined over Q(i). acknowledgement: "EP/E053262/1\tEngineering and Physical Sciences Research Council" author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Ritabrata full_name: Munshi, Ritabrata last_name: Munshi citation: ama: Browning TD, Munshi R. Rational points on singular intersections of quadrics. Compositio Mathematica. 2013;149(9):1457-1494. doi:10.1112/S0010437X13007185 apa: Browning, T. D., & Munshi, R. (2013). Rational points on singular intersections of quadrics. Compositio Mathematica. Cambridge University Press. https://doi.org/10.1112/S0010437X13007185 chicago: Browning, Timothy D, and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” Compositio Mathematica. Cambridge University Press, 2013. https://doi.org/10.1112/S0010437X13007185. ieee: T. D. Browning and R. Munshi, “Rational points on singular intersections of quadrics,” Compositio Mathematica, vol. 149, no. 9. Cambridge University Press, pp. 1457–1494, 2013. ista: Browning TD, Munshi R. 2013. Rational points on singular intersections of quadrics. Compositio Mathematica. 149(9), 1457–1494. mla: Browning, Timothy D., and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” Compositio Mathematica, vol. 149, no. 9, Cambridge University Press, 2013, pp. 1457–94, doi:10.1112/S0010437X13007185. short: T.D. Browning, R. Munshi, Compositio Mathematica 149 (2013) 1457–1494. date_created: 2018-12-11T11:45:25Z date_published: 2013-09-01T00:00:00Z date_updated: 2021-01-12T06:57:37Z day: '01' doi: 10.1112/S0010437X13007185 extern: 1 intvolume: ' 149' issue: '9' month: '09' page: 1457 - 1494 publication: Compositio Mathematica publication_status: published publisher: Cambridge University Press publist_id: '7658' quality_controlled: 0 status: public title: Rational points on singular intersections of quadrics type: journal_article volume: 149 year: '2013' ... --- _id: '2471' abstract: - lang: eng text: The impact of disulfide bonds on protein stability goes beyond simple equilibrium thermodynamics effects associated with the conformational entropy of the unfolded state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional association and strongly affect the rates of irreversible enzyme inactivation, highly relevant in biotechnological applications. While these kinetic-stability effects remain poorly understood, by analogy with proposed mechanisms for processes of protein aggregation and fibrillogenesis, we propose that they may be determined by the properties of sparsely-populated, partially-unfolded intermediates. Here we report the successful design, on the basis of high temperature molecular-dynamics simulations, of six thermodynamically and kinetically stabilized variants of phytase from Citrobacter braakii (a biotechnologically important enzyme) with one, two or three engineered disulfides. Activity measurements and 3D crystal structure determination demonstrate that the engineered crosslinks do not cause dramatic alterations in the native structure. The inactivation kinetics for all the variants displays a strongly non-Arrhenius temperature dependence, with the time-scale for the irreversible denaturation process reaching a minimum at a given temperature within the range of the denaturation transition. We show this striking feature to be a signature of a key role played by a partially unfolded, intermediate state/ensemble. Energetic and mutational analyses confirm that the intermediate is highly unfolded (akin to a proposed critical intermediate in the misfolding of the prion protein), a result that explains the observed kinetic stabilization. Our results provide a rationale for the kinetic-stability consequences of disulfide-crosslink engineering and an experimental methodology to arrive at energetic/structural descriptions of the sparsely populated and elusive intermediates that play key roles in irreversible protein denaturation. article_number: e70013 author: - first_name: Inmaculada full_name: Sanchez Romero, Inmaculada id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87 last_name: Sanchez Romero - first_name: Antonio full_name: Ariza, Antonio last_name: Ariza - first_name: Keith full_name: Wilson, Keith last_name: Wilson - first_name: Michael full_name: Skjøt, Michael last_name: Skjøt - first_name: Jesper full_name: Vind, Jesper last_name: Vind - first_name: Leonardo full_name: De Maria, Leonardo last_name: De Maria - first_name: Lars full_name: Skov, Lars last_name: Skov - first_name: Jose full_name: Sánchez Ruiz, Jose last_name: Sánchez Ruiz citation: ama: Sanchez-Romero I, Ariza A, Wilson K, et al. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070013 apa: Sanchez-Romero, I., Ariza, A., Wilson, K., Skjøt, M., Vind, J., De Maria, L., … Sánchez Ruiz, J. (2013). Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070013 chicago: Sanchez-Romero, Inmaculada, Antonio Ariza, Keith Wilson, Michael Skjøt, Jesper Vind, Leonardo De Maria, Lars Skov, and Jose Sánchez Ruiz. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070013. ieee: I. Sanchez-Romero et al., “Mechanism of protein kinetic stabilization by engineered disulfide crosslinks,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013. ista: Sanchez-Romero I, Ariza A, Wilson K, Skjøt M, Vind J, De Maria L, Skov L, Sánchez Ruiz J. 2013. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 8(7), e70013. mla: Sanchez-Romero, Inmaculada, et al. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” PLoS One, vol. 8, no. 7, e70013, Public Library of Science, 2013, doi:10.1371/journal.pone.0070013. short: I. Sanchez-Romero, A. Ariza, K. Wilson, M. Skjøt, J. Vind, L. De Maria, L. Skov, J. Sánchez Ruiz, PLoS One 8 (2013). date_created: 2018-12-11T11:57:51Z date_published: 2013-07-30T00:00:00Z date_updated: 2021-01-12T06:57:41Z day: '30' ddc: - '570' department: - _id: HaJa doi: 10.1371/journal.pone.0070013 file: - access_level: open_access checksum: c0c96cc76ed7ef0d036a31a7e33c9a37 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:07Z date_updated: 2020-07-14T12:45:41Z file_id: '5124' file_name: IST-2016-414-v1+1_journal.pone.0070013.pdf file_size: 1323666 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 8' issue: '7' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '4430' pubrep_id: '414' quality_controlled: '1' scopus_import: 1 status: public title: Mechanism of protein kinetic stabilization by engineered disulfide crosslinks 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2013' ... --- _id: '2472' abstract: - lang: eng text: Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone auxin are required for tissue-specific directional auxin transport and cellular auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important roles in developmental processes such as embryogenesis, organogenesis, vascular tissue differentiation, root meristem patterning and tropic growth. Here we analyzed roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible and is expressed during multiple auxin-regulated developmental processes. Loss of pin6 function interfered with primary root growth and lateral root development. Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis in other growth processes such as shoot apical dominance, lateral root primordia development, adventitious root formation, root hair outgrowth and root waving. These changes in auxin-regulated growth correlated with a reduction in total auxin transport as well as with an altered activity of DR5-GUS auxin response reporter. Overall, the data indicate that PIN6 regulates auxin homeostasis during plant development. article_number: e70069 author: - first_name: Christopher full_name: Cazzonelli, Christopher last_name: Cazzonelli - first_name: Marleen full_name: Vanstraelen, Marleen last_name: Vanstraelen - first_name: Sibu full_name: Simon, Sibu id: 4542EF9A-F248-11E8-B48F-1D18A9856A87 last_name: Simon orcid: 0000-0002-1998-6741 - first_name: Kuide full_name: Yin, Kuide last_name: Yin - first_name: Ashley full_name: Carron Arthur, Ashley last_name: Carron Arthur - first_name: Nazia full_name: Nisar, Nazia last_name: Nisar - first_name: Gauri full_name: Tarle, Gauri last_name: Tarle - first_name: Abby full_name: Cuttriss, Abby last_name: Cuttriss - first_name: Iain full_name: Searle, Iain last_name: Searle - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 - first_name: Ulrike full_name: Mathesius, Ulrike last_name: Mathesius - first_name: Josette full_name: Masle, Josette last_name: Masle - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Barry full_name: Pogson, Barry last_name: Pogson citation: ama: Cazzonelli C, Vanstraelen M, Simon S, et al. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070069 apa: Cazzonelli, C., Vanstraelen, M., Simon, S., Yin, K., Carron Arthur, A., Nisar, N., … Pogson, B. (2013). Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070069 chicago: Cazzonelli, Christopher, Marleen Vanstraelen, Sibu Simon, Kuide Yin, Ashley Carron Arthur, Nazia Nisar, Gauri Tarle, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070069. ieee: C. Cazzonelli et al., “Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013. ista: Cazzonelli C, Vanstraelen M, Simon S, Yin K, Carron Arthur A, Nisar N, Tarle G, Cuttriss A, Searle I, Benková E, Mathesius U, Masle J, Friml J, Pogson B. 2013. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 8(7), e70069. mla: Cazzonelli, Christopher, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” PLoS One, vol. 8, no. 7, e70069, Public Library of Science, 2013, doi:10.1371/journal.pone.0070069. short: C. Cazzonelli, M. Vanstraelen, S. Simon, K. Yin, A. Carron Arthur, N. Nisar, G. Tarle, A. Cuttriss, I. Searle, E. Benková, U. Mathesius, J. Masle, J. Friml, B. Pogson, PLoS One 8 (2013). date_created: 2018-12-11T11:57:52Z date_published: 2013-07-29T00:00:00Z date_updated: 2021-01-12T06:57:41Z day: '29' ddc: - '580' - '570' department: - _id: JiFr - _id: EvBe doi: 10.1371/journal.pone.0070069 ec_funded: 1 file: - access_level: open_access checksum: 3be71828b6c2ba9c90eb7056e3f7f57a content_type: application/pdf creator: system date_created: 2018-12-12T10:16:34Z date_updated: 2020-07-14T12:45:41Z file_id: '5222' file_name: IST-2015-393-v1+1_journal.pone.0070069.pdf file_size: 9003465 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 8' issue: '7' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 253FCA6A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '207362' name: Hormonal cross-talk in plant organogenesis - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '4431' pubrep_id: '393' quality_controlled: '1' scopus_import: 1 status: public title: Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2013' ... --- _id: '2470' abstract: - lang: eng text: Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and its function is indispensable for plant growth and development. ABP1 has been shown to be involved in auxin-dependent regulation of cell division and expansion, in plasma-membrane-related processes such as changes in transmembrane potential, and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated downstream pathway remains elusive.Methodology/Principal Findings:Using auxin transport assays and quantitative analysis of cellular morphology we show that ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can counterbalance increased auxin efflux and auxin starvation phenotypes caused by the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the ABP1-controlled vesicle trafficking processes, including positive regulation of endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The findings indicate the involvement of ABP1 in control of rate of auxin transport across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity at the plasma membrane, and highlighting the relevance of ABP1 for the formation of developmentally important, PIN-dependent auxin gradients. article_number: e70050 author: - first_name: Milada full_name: Čovanová, Milada last_name: Čovanová - first_name: Michael full_name: Sauer, Michael last_name: Sauer - first_name: Jan full_name: Rychtář, Jan last_name: Rychtář - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Jan full_name: Petrášek, Jan last_name: Petrášek - first_name: Eva full_name: Zažímalová, Eva last_name: Zažímalová citation: ama: Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070050 apa: Čovanová, M., Sauer, M., Rychtář, J., Friml, J., Petrášek, J., & Zažímalová, E. (2013). Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070050 chicago: Čovanová, Milada, Michael Sauer, Jan Rychtář, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070050. ieee: M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, and E. Zažímalová, “Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013. ista: Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. 2013. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 8(7), e70050. mla: Čovanová, Milada, et al. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” PLoS One, vol. 8, no. 7, e70050, Public Library of Science, 2013, doi:10.1371/journal.pone.0070050. short: M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, E. Zažímalová, PLoS One 8 (2013). date_created: 2018-12-11T11:57:51Z date_published: 2013-07-23T00:00:00Z date_updated: 2021-01-12T06:57:40Z day: '23' ddc: - '570' department: - _id: JiFr doi: 10.1371/journal.pone.0070050 file: - access_level: open_access checksum: 2d47ef47616ef4de1d517d146548184e content_type: application/pdf creator: system date_created: 2018-12-12T10:08:21Z date_updated: 2020-07-14T12:45:41Z file_id: '4681' file_name: IST-2016-413-v1+1_journal.pone.0070050.pdf file_size: 2294955 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 8' issue: '7' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '4432' pubrep_id: '413' quality_controlled: '1' scopus_import: 1 status: public title: Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2013' ... --- _id: '2466' abstract: - lang: eng text: 'We introduce a new method for efficiently simulating liquid with extreme amounts of spatial adaptivity. Our method combines several key components to drastically speed up the simulation of large-scale fluid phenomena: We leverage an alternative Eulerian tetrahedral mesh discretization to significantly reduce the complexity of the pressure solve while increasing the robustness with respect to element quality and removing the possibility of locking. Next, we enable subtle free-surface phenomena by deriving novel second-order boundary conditions consistent with our discretization. We couple this discretization with a spatially adaptive Fluid-Implicit Particle (FLIP) method, enabling efficient, robust, minimally-dissipative simulations that can undergo sharp changes in spatial resolution while minimizing artifacts. Along the way, we provide a new method for generating a smooth and detailed surface from a set of particles with variable sizes. Finally, we explore several new sizing functions for determining spatially adaptive simulation resolutions, and we show how to couple them to our simulator. We combine each of these elements to produce a simulation algorithm that is capable of creating animations at high maximum resolutions while avoiding common pitfalls like inaccurate boundary conditions and inefficient computation.' article_number: '103' author: - first_name: Ryoichi full_name: Ando, Ryoichi last_name: Ando - first_name: Nils full_name: Thuerey, Nils last_name: Thuerey - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Ando R, Thuerey N, Wojtan C. Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461982 apa: Ando, R., Thuerey, N., & Wojtan, C. (2013). Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461982 chicago: Ando, Ryoichi, Nils Thuerey, and Chris Wojtan. “Highly Adaptive Liquid Simulations on Tetrahedral Meshes.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461982. ieee: R. Ando, N. Thuerey, and C. Wojtan, “Highly adaptive liquid simulations on tetrahedral meshes,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013. ista: Ando R, Thuerey N, Wojtan C. 2013. Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. 32(4), 103. mla: Ando, Ryoichi, et al. “Highly Adaptive Liquid Simulations on Tetrahedral Meshes.” ACM Transactions on Graphics, vol. 32, no. 4, 103, ACM, 2013, doi:10.1145/2461912.2461982. short: R. Ando, N. Thuerey, C. Wojtan, ACM Transactions on Graphics 32 (2013). date_created: 2018-12-11T11:57:50Z date_published: 2013-07-01T00:00:00Z date_updated: 2023-02-23T10:44:14Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1145/2461912.2461982 file: - access_level: open_access checksum: aeea6b0ff2b27c695aeb8408c7d2fc50 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:25Z date_updated: 2020-07-14T12:45:41Z file_id: '5279' file_name: IST-2016-605-v1+1_tetflip_fixed.pdf file_size: 8601561 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 32' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4436' pubrep_id: '605' quality_controlled: '1' scopus_import: 1 status: public title: Highly adaptive liquid simulations on tetrahedral meshes type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2013' ... --- _id: '2467' abstract: - lang: eng text: This paper presents a method for computing topology changes for triangle meshes in an interactive geometric modeling environment. Most triangle meshes in practice do not exhibit desirable geometric properties, so we develop a solution that is independent of standard assumptions and robust to geometric errors. Specifically, we provide the first method for topology change applicable to arbitrary non-solid, non-manifold, non-closed, self-intersecting surfaces. We prove that this new method for topology change produces the expected conventional results when applied to solid (closed, manifold, non-self-intersecting) surfaces---that is, we prove a backwards-compatibility property relative to prior work. Beyond solid surfaces, we present empirical evidence that our method remains tolerant to a variety of surface aberrations through the incorporation of a novel error correction scheme. Finally, we demonstrate how topology change applied to non-solid objects enables wholly new and useful behaviors. article_number: '34' author: - first_name: Gilbert full_name: Bernstein, Gilbert last_name: Bernstein - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: 'Bernstein G, Wojtan C. Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2462027' apa: 'Bernstein, G., & Wojtan, C. (2013). Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2462027' chicago: 'Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2462027.' ieee: 'G. Bernstein and C. Wojtan, “Putting holes in holey geometry: Topology change for arbitrary surfaces,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.' ista: 'Bernstein G, Wojtan C. 2013. Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. 32(4), 34.' mla: 'Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” ACM Transactions on Graphics, vol. 32, no. 4, 34, ACM, 2013, doi:10.1145/2461912.2462027.' short: G. Bernstein, C. Wojtan, ACM Transactions on Graphics 32 (2013). date_created: 2018-12-11T11:57:50Z date_published: 2013-07-01T00:00:00Z date_updated: 2023-02-23T10:44:16Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1145/2461912.2462027 file: - access_level: open_access checksum: 9c8425d62246996ca632c5a01870515b content_type: application/pdf creator: system date_created: 2018-12-12T10:09:43Z date_updated: 2020-07-14T12:45:41Z file_id: '4768' file_name: IST-2016-604-v1+1_toptop2013.pdf file_size: 3514674 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 32' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4435' pubrep_id: '604' quality_controlled: '1' scopus_import: 1 status: public title: 'Putting holes in holey geometry: Topology change for arbitrary surfaces' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2013' ... --- _id: '2468' abstract: - lang: eng text: Our work concerns the combination of an Eulerian liquid simulation with a high-resolution surface tracker (e.g. the level set method or a Lagrangian triangle mesh). The naive application of a high-resolution surface tracker to a low-resolution velocity field can produce many visually disturbing physical and topological artifacts that limit their use in practice. We address these problems by defining an error function which compares the current state of the surface tracker to the set of physically valid surface states. By reducing this error with a gradient descent technique, we introduce a novel physics-based surface fairing method. Similarly, by treating this error function as a potential energy, we derive a new surface correction force that mimics the vortex sheet equations. We demonstrate our results with both level set and mesh-based surface trackers. article_number: '68' author: - first_name: Morten full_name: Bojsen-Hansen, Morten id: 439F0C8C-F248-11E8-B48F-1D18A9856A87 last_name: Bojsen-Hansen orcid: 0000-0002-4417-3224 - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Bojsen-Hansen M, Wojtan C. Liquid surface tracking with error compensation. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461991 apa: Bojsen-Hansen, M., & Wojtan, C. (2013). Liquid surface tracking with error compensation. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461991 chicago: Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461991. ieee: M. Bojsen-Hansen and C. Wojtan, “Liquid surface tracking with error compensation,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013. ista: Bojsen-Hansen M, Wojtan C. 2013. Liquid surface tracking with error compensation. ACM Transactions on Graphics. 32(4), 68. mla: Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” ACM Transactions on Graphics, vol. 32, no. 4, 68, ACM, 2013, doi:10.1145/2461912.2461991. short: M. Bojsen-Hansen, C. Wojtan, ACM Transactions on Graphics 32 (2013). date_created: 2018-12-11T11:57:50Z date_published: 2013-07-01T00:00:00Z date_updated: 2023-02-23T10:44:18Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1145/2461912.2461991 file: - access_level: open_access checksum: 53d905e0180e23ef3e813b969ffed4e1 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:37Z date_updated: 2020-07-14T12:45:41Z file_id: '4761' file_name: IST-2016-603-v1+1_liquidError_web.pdf file_size: 5813685 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 32' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4434' pubrep_id: '603' quality_controlled: '1' scopus_import: 1 status: public title: Liquid surface tracking with error compensation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2013' ... --- _id: '2469' abstract: - lang: eng text: Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals. By regulating contact formation and stability, cadherins play a crucial role in tissue morphogenesis and homeostasis. Here, we review the three major unctions of cadherins in cell–cell contact formation and stability. Two of those functions lead to a decrease in interfacial ension at the forming cell–cell contact, thereby promoting contact expansion — first, by providing adhesion tension that lowers interfacial tension at the cell–cell contact, and second, by signaling to the actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial tension at the contact. The third function of cadherins in cell–cell contact formation is to stabilize the contact by resisting mechanical forces that pull on the contact. author: - first_name: Jean-Léon full_name: Maître, Jean-Léon id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87 last_name: Maître orcid: 0000-0002-3688-1474 - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: Maître J-L, Heisenberg C-PJ. Three functions of cadherins in cell adhesion. Current Biology. 2013;23(14):R626-R633. doi:10.1016/j.cub.2013.06.019 apa: Maître, J.-L., & Heisenberg, C.-P. J. (2013). Three functions of cadherins in cell adhesion. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.06.019 chicago: Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” Current Biology. Cell Press, 2013. https://doi.org/10.1016/j.cub.2013.06.019. ieee: J.-L. Maître and C.-P. J. Heisenberg, “Three functions of cadherins in cell adhesion,” Current Biology, vol. 23, no. 14. Cell Press, pp. R626–R633, 2013. ista: Maître J-L, Heisenberg C-PJ. 2013. Three functions of cadherins in cell adhesion. Current Biology. 23(14), R626–R633. mla: Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” Current Biology, vol. 23, no. 14, Cell Press, 2013, pp. R626–33, doi:10.1016/j.cub.2013.06.019. short: J.-L. Maître, C.-P.J. Heisenberg, Current Biology 23 (2013) R626–R633. date_created: 2018-12-11T11:57:51Z date_published: 2013-07-22T00:00:00Z date_updated: 2021-01-12T06:57:40Z day: '22' ddc: - '570' department: - _id: CaHe doi: 10.1016/j.cub.2013.06.019 external_id: pmid: - '23885883' file: - access_level: open_access checksum: 6a424b2f007b41d4955a9135793b2162 content_type: application/pdf creator: dernst date_created: 2019-01-24T15:40:22Z date_updated: 2020-07-14T12:45:41Z file_id: '5881' file_name: 2013_CurrentBiology_Maitre.pdf file_size: 247320 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 23' issue: '14' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: R626 - R633 pmid: 1 publication: Current Biology publication_status: published publisher: Cell Press publist_id: '4433' quality_controlled: '1' scopus_import: 1 status: public title: Three functions of cadherins in cell adhesion 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2013' ... --- _id: '247' abstract: - lang: eng text: An improved estimate is provided for the number of Fq-rational points on a geometrically irreducible, projective, cubic hypersurface that is not equal to a cone. acknowledgement: "EP/E053262/1\tEngineering and Physical Sciences Research Council" author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: Browning TD. The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. 2013;56(3):500-502. doi:10.4153/CMB-2011-177-4 apa: Browning, T. D. (2013). The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. Unknown. https://doi.org/10.4153/CMB-2011-177-4 chicago: Browning, Timothy D. “The Lang-Weil Estimate for Cubic Hypersurfaces.” Canadian Mathematical Bulletin. Unknown, 2013. https://doi.org/10.4153/CMB-2011-177-4. ieee: T. D. Browning, “The Lang-Weil estimate for cubic hypersurfaces,” Canadian Mathematical Bulletin, vol. 56, no. 3. Unknown, pp. 500–502, 2013. ista: Browning TD. 2013. The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. 56(3), 500–502. mla: Browning, Timothy D. “The Lang-Weil Estimate for Cubic Hypersurfaces.” Canadian Mathematical Bulletin, vol. 56, no. 3, Unknown, 2013, pp. 500–02, doi:10.4153/CMB-2011-177-4. short: T.D. Browning, Canadian Mathematical Bulletin 56 (2013) 500–502. date_created: 2018-12-11T11:45:25Z date_published: 2013-08-31T00:00:00Z date_updated: 2021-01-12T06:57:40Z day: '31' doi: 10.4153/CMB-2011-177-4 extern: 1 intvolume: ' 56' issue: '3' month: '08' page: 500 - 502 publication: Canadian Mathematical Bulletin publication_status: published publisher: Unknown publist_id: '7657' quality_controlled: 0 status: public title: The Lang-Weil estimate for cubic hypersurfaces type: journal_article volume: 56 year: '2013' ... --- _id: '2473' abstract: - lang: eng text: 'When a mutation with selective advantage s spreads through a panmictic population, it may cause two lineages at a linked locus to coalesce; the probability of coalescence is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid individuals, and r is the recombination rate. Population structure delays fixation, and so weakens the effect of a selective sweep. However, favourable alleles spread through a spatially continuous population behind a narrow wavefront; ancestral lineages are confined at the tip of this front, and so coalesce rapidly. In extremely dense populations, coalescence is dominated by rare fluctuations ahead of the front. However, we show that for moderate densities, a simple quasi-deterministic approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ), where ρ is the population density and is the characteristic scale of the wavefront; g(η) depends only on the strength of random drift, . The net effect of a sweep on coalescence also depends crucially on whether two lineages are ever both within the wavefront at the same time: even in the extreme case when coalescence within the front is instantaneous, the net rate of coalescence may be lower than in a single panmictic population. Sweeps can also have a substantial impact on the rate of gene flow. A single lineage will jump to a new location when it is hit by a sweep, with mean square displacement ; this can be substantial if the species’ range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R, is small. This effect is half as strong in two dimensions. In contrast, the rate of coalescence between lineages, at random locations in space and on the genetic map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average, one-dimensional structure is likely to reduce coalescence due to sweeps, relative to panmixis. In two dimensions, genes must move along the front before they can coalesce; this process is rapid, being dominated by rare fluctuations. This leads to a dramatically higher rate of coalescence within the wavefront than if lineages simply diffused along the front. Nevertheless, the net rate of coalescence due to a sweep through a two-dimensional population is likely to be lower than it would be with panmixis.' author: - 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: Alison full_name: Etheridge, Alison last_name: Etheridge - first_name: Jerome full_name: Kelleher, Jerome last_name: Kelleher - first_name: Amandine full_name: Véber, Amandine last_name: Véber citation: ama: Barton NH, Etheridge A, Kelleher J, Véber A. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 2013;87(8):75-89. doi:10.1016/j.tpb.2012.12.001 apa: Barton, N. H., Etheridge, A., Kelleher, J., & Véber, A. (2013). Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. Elsevier. https://doi.org/10.1016/j.tpb.2012.12.001 chicago: Barton, Nicholas H, Alison Etheridge, Jerome Kelleher, and Amandine Véber. “Genetic Hitch-Hiking in Spatially Extended Populations.” Theoretical Population Biology. Elsevier, 2013. https://doi.org/10.1016/j.tpb.2012.12.001. ieee: N. H. Barton, A. Etheridge, J. Kelleher, and A. Véber, “Genetic hitch-hiking in spatially extended populations,” Theoretical Population Biology, vol. 87, no. 8. Elsevier, pp. 75–89, 2013. ista: Barton NH, Etheridge A, Kelleher J, Véber A. 2013. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 87(8), 75–89. mla: Barton, Nicholas H., et al. “Genetic Hitch-Hiking in Spatially Extended Populations.” Theoretical Population Biology, vol. 87, no. 8, Elsevier, 2013, pp. 75–89, doi:10.1016/j.tpb.2012.12.001. short: N.H. Barton, A. Etheridge, J. Kelleher, A. Véber, Theoretical Population Biology 87 (2013) 75–89. date_created: 2018-12-11T11:57:52Z date_published: 2013-01-03T00:00:00Z date_updated: 2021-01-12T06:57:42Z day: '03' ddc: - '570' department: - _id: NiBa doi: 10.1016/j.tpb.2012.12.001 ec_funded: 1 file: - access_level: open_access checksum: 4274ec1f433b838a7d5b941cc9684ca7 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:54Z date_updated: 2020-07-14T12:45:41Z file_id: '5376' file_name: IST-2013-118-v1+1_bartonetalRevision.pdf file_size: 1706282 relation: main_file file_date_updated: 2020-07-14T12:45:41Z has_accepted_license: '1' intvolume: ' 87' issue: '8' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 75 - 89 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Theoretical Population Biology publication_status: published publisher: Elsevier publist_id: '4428' pubrep_id: '118' quality_controlled: '1' scopus_import: 1 status: public title: Genetic hitch-hiking in spatially extended populations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 87 year: '2013' ... --- _id: '2478' abstract: - lang: eng text: Despite the pivotal functions of the NMDA receptor (NMDAR) for neural circuit development and synaptic plasticity, the molecular mechanisms underlying the dynamics of NMDAR trafficking are poorly understood. The cell adhesion molecule neuroligin-1 (NL1) modifies NMDAR-dependent synaptic transmission and synaptic plasticity, but it is unclear whether NL1 controls synaptic accumulation or function of the receptors. Here, we provide evidence that NL1 regulates the abundance of NMDARs at postsynaptic sites. This function relies on extracellular, NL1 isoform-specific sequences that facilitate biochemical interactions between NL1 and the NMDAR GluN1 subunit. Our work uncovers NL1 isoform-specific cisinteractions with ionotropic glutamate receptors as a key mechanism for controlling synaptic properties. author: - first_name: Elaine full_name: Budreck, Elaine C last_name: Budreck - first_name: Oh full_name: Kwon, Oh-Bin last_name: Kwon - first_name: Jung full_name: Jung, Jung-Hoon last_name: Jung - first_name: Stéphane full_name: Baudouin, Stéphane J last_name: Baudouin - first_name: Albert full_name: Thommen, Albert last_name: Thommen - first_name: Hye full_name: Kim, Hye-Sun last_name: Kim - first_name: Yugo full_name: Fukazawa, Yugo last_name: Fukazawa - first_name: Harumi full_name: Harumi Harada id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87 last_name: Harada orcid: 0000-0001-7429-7896 - first_name: Katsuhiko full_name: Tabuchi, Katsuhiko last_name: Tabuchi - first_name: Ryuichi full_name: Ryuichi Shigemoto id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Peter full_name: Scheiffele, Peter last_name: Scheiffele - first_name: Joung full_name: Kim, Joung-Hun last_name: Kim citation: ama: Budreck E, Kwon O, Jung J, et al. Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. 2013;110(2):725-730. doi:10.1073/pnas.1214718110 apa: Budreck, E., Kwon, O., Jung, J., Baudouin, S., Thommen, A., Kim, H., … Kim, J. (2013). Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1214718110 chicago: Budreck, Elaine, Oh Kwon, Jung Jung, Stéphane Baudouin, Albert Thommen, Hye Kim, Yugo Fukazawa, et al. “Neuroligin-1 Controls Synaptic Abundance of NMDA-Type Glutamate Receptors through Extracellular Coupling.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1214718110. ieee: E. Budreck et al., “Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling,” PNAS, vol. 110, no. 2. National Academy of Sciences, pp. 725–730, 2013. ista: Budreck E, Kwon O, Jung J, Baudouin S, Thommen A, Kim H, Fukazawa Y, Harada H, Tabuchi K, Shigemoto R, Scheiffele P, Kim J. 2013. Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. 110(2), 725–730. mla: Budreck, Elaine, et al. “Neuroligin-1 Controls Synaptic Abundance of NMDA-Type Glutamate Receptors through Extracellular Coupling.” PNAS, vol. 110, no. 2, National Academy of Sciences, 2013, pp. 725–30, doi:10.1073/pnas.1214718110. short: E. Budreck, O. Kwon, J. Jung, S. Baudouin, A. Thommen, H. Kim, Y. Fukazawa, H. Harada, K. Tabuchi, R. Shigemoto, P. Scheiffele, J. Kim, PNAS 110 (2013) 725–730. date_created: 2018-12-11T11:57:54Z date_published: 2013-01-08T00:00:00Z date_updated: 2021-01-12T06:57:43Z day: '08' doi: 10.1073/pnas.1214718110 extern: 1 intvolume: ' 110' issue: '2' month: '01' page: 725 - 730 publication: PNAS publication_status: published publisher: National Academy of Sciences publist_id: '4423' quality_controlled: 0 status: public title: Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling type: journal_article volume: 110 year: '2013' ... --- _id: '250' abstract: - lang: eng text: Châtelet surfaces provide a rich source of geometrically rational surfaces that do not always satisfy the Hasse principle. Restricting attention to a special class of Châtelet surfaces, we investigate the frequency that such counter-examples arise over the rational numbers. acknowledgement: While working on this paper, the first author was supported by an IUF Junior and ANR while the second author was supported by ERC grant 306457. author: - first_name: Régis full_name: de la Bretèche, Régis last_name: De La Bretèche - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: De La Bretèche R, Browning TD. Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. 2013;108(4):1030-1078. doi:10.1112/plms/pdt060 apa: De La Bretèche, R., & Browning, T. D. (2013). Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. Oxford University Press. https://doi.org/10.1112/plms/pdt060 chicago: De La Bretèche, Régis, and Timothy D Browning. “Density of Châtelet Surfaces Failing the Hasse Principle.” Proceedings of the London Mathematical Society. Oxford University Press, 2013. https://doi.org/10.1112/plms/pdt060. ieee: R. De La Bretèche and T. D. Browning, “Density of Châtelet surfaces failing the Hasse principle,” Proceedings of the London Mathematical Society, vol. 108, no. 4. Oxford University Press, pp. 1030–1078, 2013. ista: De La Bretèche R, Browning TD. 2013. Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. 108(4), 1030–1078. mla: De La Bretèche, Régis, and Timothy D. Browning. “Density of Châtelet Surfaces Failing the Hasse Principle.” Proceedings of the London Mathematical Society, vol. 108, no. 4, Oxford University Press, 2013, pp. 1030–78, doi:10.1112/plms/pdt060. short: R. De La Bretèche, T.D. Browning, Proceedings of the London Mathematical Society 108 (2013) 1030–1078. date_created: 2018-12-11T11:45:26Z date_published: 2013-11-29T00:00:00Z date_updated: 2021-01-12T06:57:51Z day: '29' doi: 10.1112/plms/pdt060 extern: 1 intvolume: ' 108' issue: '4' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1210.4010 month: '11' oa: 1 page: 1030 - 1078 publication: Proceedings of the London Mathematical Society publication_status: published publisher: Oxford University Press publist_id: '7652' quality_controlled: 0 status: public title: Density of Châtelet surfaces failing the Hasse principle type: journal_article volume: 108 year: '2013' ... --- _id: '251' abstract: - lang: eng text: We study the density of varieties in a certain family which do not satisfy the Hasse principle. This work relies on results recently obtained by Colliot-Thélène [3]. author: - first_name: Régis full_name: de la Bretèche, Régis last_name: De La Bretèche - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: De La Bretèche R, Browning TD. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 2013;26(1):25-44. doi:10.5802/jtnb.857 apa: De La Bretèche, R., & Browning, T. D. (2013). Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I. https://doi.org/10.5802/jtnb.857 chicago: De La Bretèche, Régis, and Timothy D Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I, 2013. https://doi.org/10.5802/jtnb.857. ieee: R. De La Bretèche and T. D. Browning, “Counter examples to the Hasse principle among certain coflasque tori,” Journal de Theorie des Nombres de Bordeaux, vol. 26, no. 1. Universite de Bordeaux I, pp. 25–44, 2013. ista: De La Bretèche R, Browning TD. 2013. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 26(1), 25–44. mla: De La Bretèche, Régis, and Timothy D. Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux, vol. 26, no. 1, Universite de Bordeaux I, 2013, pp. 25–44, doi:10.5802/jtnb.857. short: R. De La Bretèche, T.D. Browning, Journal de Theorie Des Nombres de Bordeaux 26 (2013) 25–44. date_created: 2018-12-11T11:45:26Z date_published: 2013-05-14T00:00:00Z date_updated: 2021-01-12T06:57:55Z day: '14' doi: 10.5802/jtnb.857 extern: 1 intvolume: ' 26' issue: '1' month: '05' page: 25 - 44 publication: Journal de Theorie des Nombres de Bordeaux publication_status: published publisher: Universite de Bordeaux I publist_id: '7651' quality_controlled: 0 status: public title: Counter examples to the Hasse principle among certain coflasque tori type: journal_article volume: 26 year: '2013' ... --- _id: '2517' abstract: - lang: eng text: 'Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL.' acknowledgement: 'ERC Grant QUALITY. ' alternative_title: - LNCS article_processing_charge: No author: - first_name: Shaull full_name: Almagor, Shaull last_name: Almagor - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:10.1007/978-3-642-39212-2_3 apa: 'Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3' chicago: Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_3. ieee: S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013. ista: Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27. mla: Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3. short: S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27. conference: end_date: 2013-07-12 location: Riga, Latvia name: 'ICALP: Automata, Languages and Programming' start_date: 2013-07-08 date_created: 2018-12-11T11:58:08Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:47Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-39212-2_3 ec_funded: 1 file: - access_level: open_access checksum: 85afbf6c18a2c7e377c52c9410e2d824 content_type: application/pdf creator: dernst date_created: 2020-05-15T11:16:12Z date_updated: 2020-07-14T12:45:42Z file_id: '7860' file_name: 2013_ICALP_Almagor.pdf file_size: 363031 relation: main_file file_date_updated: 2020-07-14T12:45:42Z has_accepted_license: '1' intvolume: ' 7966' issue: Part 2 language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 15 - 27 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '4384' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Formalizing and reasoning about quality type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7966 year: '2013' ... --- _id: '2518' abstract: - lang: eng text: A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard. alternative_title: - LNCS author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive characterization. In: Vol 7965. Springer; 2013:625-636. doi:10.1007/978-3-642-39206-1_53' apa: 'Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39206-1_53' chicago: 'Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. https://doi.org/10.1007/978-3-642-39206-1_53.' ieee: 'V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.' ista: 'Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.' mla: 'Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.' short: V. Kolmogorov, in:, Springer, 2013, pp. 625–636. conference: end_date: 2013-07-12 location: Riga, Latvia name: 'ICALP: Automata, Languages and Programming' start_date: 2013-07-08 date_created: 2018-12-11T11:58:08Z date_published: 2013-07-01T00:00:00Z date_updated: 2023-02-23T10:35:42Z day: '01' department: - _id: VlKo doi: 10.1007/978-3-642-39206-1_53 external_id: arxiv: - '1207.7213' intvolume: ' 7965' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1207.7213 month: '07' oa: 1 oa_version: Preprint page: 625 - 636 publication_status: published publisher: Springer publist_id: '4383' quality_controlled: '1' related_material: record: - id: '2271' relation: later_version status: public scopus_import: 1 status: public title: 'The power of linear programming for finite-valued CSPs: A constructive characterization' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7965 year: '2013' ... --- _id: '2516' abstract: - lang: eng text: 'We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object''s color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes.' author: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Hannes full_name: Nickisch, Hannes last_name: Nickisch - first_name: Stefan full_name: Harmeling, Stefan last_name: Harmeling citation: ama: Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2013;36(3):453-465. doi:10.1109/TPAMI.2013.140 apa: Lampert, C., Nickisch, H., & Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2013.140 chicago: Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2013. https://doi.org/10.1109/TPAMI.2013.140. ieee: C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3. IEEE, pp. 453–465, 2013. ista: Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465. mla: Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:10.1109/TPAMI.2013.140. short: C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465. date_created: 2018-12-11T11:58:08Z date_published: 2013-07-30T00:00:00Z date_updated: 2021-01-12T06:57:58Z day: '30' department: - _id: ChLa doi: 10.1109/TPAMI.2013.140 intvolume: ' 36' issue: '3' language: - iso: eng month: '07' oa_version: None page: 453 - 465 publication: IEEE Transactions on Pattern Analysis and Machine Intelligence publication_status: published publisher: IEEE publist_id: '4385' quality_controlled: '1' scopus_import: 1 status: public title: Attribute-based classification for zero-shot learning of object categories type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2013' ... --- _id: '2520' abstract: - lang: eng text: "We propose a probabilistic model to infer supervised latent variables in\r\nthe Hamming space from observed data. Our model allows simultaneous\r\ninference of the number of binary latent variables, and their values. The\r\nlatent variables preserve neighbourhood structure of the data in a sense\r\nthat objects in the same semantic concept have similar latent values, and\r\nobjects in different concepts have dissimilar latent values. We formulate\r\nthe supervised infinite latent variable problem based on an intuitive\r\nprinciple of pulling objects together if they are of the same type, and\r\npushing them apart if they are not. We then combine this principle with a\r\nflexible Indian Buffet Process prior on the latent variables. We show that\r\nthe inferred supervised latent variables can be directly used to perform a\r\nnearest neighbour search for the purpose of retrieval. We introduce a new\r\napplication of dynamically extending hash codes, and show how to\r\neffectively couple the structure of the hash codes with continuously\r\ngrowing structure of the neighbourhood preserving infinite latent feature\r\nspace." author: - first_name: Novi full_name: Quadrianto, Novi last_name: Quadrianto - first_name: Viktoriia full_name: Sharmanska, Viktoriia id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87 last_name: Sharmanska orcid: 0000-0003-0192-9308 - first_name: David full_name: Knowles, David last_name: Knowles - first_name: Zoubin full_name: Ghahramani, Zoubin last_name: Ghahramani citation: ama: 'Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood preserving infinite latent feature models. In: Proceedings of the 29th Conference Uncertainty in Artificial Intelligence. AUAI Press; 2013:527-536.' apa: 'Quadrianto, N., Sharmanska, V., Knowles, D., & Ghahramani, Z. (2013). The supervised IBP: Neighbourhood preserving infinite latent feature models. In Proceedings of the 29th conference uncertainty in Artificial Intelligence (pp. 527–536). Bellevue, WA, United States: AUAI Press.' chicago: 'Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” In Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, 527–36. AUAI Press, 2013.' ieee: 'N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised IBP: Neighbourhood preserving infinite latent feature models,” in Proceedings of the 29th conference uncertainty in Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 527–536.' ista: 'Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the 29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, 527–536.' mla: 'Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–36.' short: N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–536. conference: end_date: 2013-07-15 location: Bellevue, WA, United States name: 'UAI: Uncertainty in Artificial Intelligence' start_date: 2013-07-11 date_created: 2018-12-11T11:58:09Z date_published: 2013-07-11T00:00:00Z date_updated: 2023-02-23T10:46:36Z day: '11' ddc: - '000' department: - _id: ChLa file: - access_level: open_access checksum: 325f20c4b926bd74d39006b97df572bd content_type: application/pdf creator: system date_created: 2018-12-12T10:15:16Z date_updated: 2020-07-14T12:45:42Z file_id: '5134' file_name: IST-2013-137-v1+1_QuaShaKnoGha13.pdf file_size: 1117100 relation: main_file file_date_updated: 2020-07-14T12:45:42Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 527 - 536 publication: Proceedings of the 29th conference uncertainty in Artificial Intelligence publication_identifier: isbn: - '9780974903996' publication_status: published publisher: AUAI Press publist_id: '4381' pubrep_id: '137' quality_controlled: '1' scopus_import: 1 status: public title: 'The supervised IBP: Neighbourhood preserving infinite latent feature models' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '253' author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: 'Browning TD. Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. 2013;60(1):101-107. doi:10.1112/S0025579313000132' apa: 'Browning, T. D. (2013). Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. Unknown. https://doi.org/10.1112/S0025579313000132' chicago: 'Browning, Timothy D. “Counting Rational Points on Cubic Hypersurfaces: Corrigendum.” Mathematika. Unknown, 2013. https://doi.org/10.1112/S0025579313000132.' ieee: 'T. D. Browning, “Counting rational points on cubic hypersurfaces: Corrigendum,” Mathematika, vol. 60, no. 1. Unknown, pp. 101–107, 2013.' ista: 'Browning TD. 2013. Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. 60(1), 101–107.' mla: 'Browning, Timothy D. “Counting Rational Points on Cubic Hypersurfaces: Corrigendum.” Mathematika, vol. 60, no. 1, Unknown, 2013, pp. 101–07, doi:10.1112/S0025579313000132.' short: T.D. Browning, Mathematika 60 (2013) 101–107. date_created: 2018-12-11T11:45:27Z date_published: 2013-09-06T00:00:00Z date_updated: 2021-01-12T06:58:03Z day: '06' doi: 10.1112/S0025579313000132 extern: 1 intvolume: ' 60' issue: '1' month: '09' page: 101 - 107 publication: Mathematika publication_status: published publisher: Unknown publist_id: '7649' quality_controlled: 0 status: public title: 'Counting rational points on cubic hypersurfaces: Corrigendum' type: journal_article volume: 60 year: '2013' ... --- _id: '2692' abstract: - lang: eng text: The group III metabotropic glutamate (mGlu) receptors mGlu7 and mGlu8 are receiving increased attention as potential novel therapeutic targets for anxiety disorders. The effects mediated by these receptors appear to result from a complex interplay of facilitatory and inhibitory actions at different brain sites in the anxiety/fear circuits. To better understand the effect of mGlu7 and mGlu8 receptors on extinction of contextual fear and their critical sites of action in the fear networks, we focused on the amygdala. Direct injection into the basolateral complex of the amygdala of the mGlu7 receptor agonist AMN082 facilitated extinction, whereas the mGlu8 receptor agonist (S)-3,4-DCPG sustained freezing during the extinction acquisition trial. We also determined at the ultrastructural level the synaptic distribution of these receptors in the basal nucleus (BA) and intercalated cell clusters (ITCs) of the amygdala. Both areas are thought to exert key roles in fear extinction. We demonstrate that mGlu7 and mGlu8 receptors are located in different presynaptic terminals forming both asymmetric and symmetric synapses, and that they preferentially target neurons expressing mGlu1α receptors mostly located around ITCs. In addition we show that mGlu7 and mGlu8 receptors were segregated to different inputs to a significant extent. In particular, mGlu7a receptors were primarily onto glutamatergic afferents arising from the BA or midline thalamic nuclei, but not the medial prefrontal cortex (mPFC), as revealed by combined anterograde tracing and pre-embedding electron microscopy. On the other hand, mGlu8a showed a more restricted distribution in the BA and appeared absent from thalamic, mPFC and intrinsic inputs. This segregation of mGlu7 and mGlu8 receptors in different neuronal pathways of the fear circuit might explain the distinct effects on fear extinction training observed with mGlu7 and mGlu8 receptor agonists. author: - first_name: Alice full_name: Dobi, Alice last_name: Dobi - first_name: Simone full_name: Sartori, Simone B last_name: Sartori - first_name: Daniela full_name: Busti, Daniela last_name: Busti - first_name: Herman full_name: Van Der Putten, Herman V last_name: Van Der Putten - first_name: Nicolas full_name: Singewald, Nicolas last_name: Singewald - first_name: Ryuichi full_name: Ryuichi Shigemoto id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Francesco full_name: Ferraguti, Francesco last_name: Ferraguti citation: ama: Dobi A, Sartori S, Busti D, et al. Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. 2013;66:274-289. doi:10.1016/j.neuropharm.2012.05.025 apa: Dobi, A., Sartori, S., Busti, D., Van Der Putten, H., Singewald, N., Shigemoto, R., & Ferraguti, F. (2013). Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. Elsevier. https://doi.org/10.1016/j.neuropharm.2012.05.025 chicago: Dobi, Alice, Simone Sartori, Daniela Busti, Herman Van Der Putten, Nicolas Singewald, Ryuichi Shigemoto, and Francesco Ferraguti. “Neural Substrates for the Distinct Effects of Presynaptic Group III Metabotropic Glutamate Receptors on Extinction of Contextual Fear Conditioning in Mice.” Neuropharmacology. Elsevier, 2013. https://doi.org/10.1016/j.neuropharm.2012.05.025. ieee: A. Dobi et al., “Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice,” Neuropharmacology, vol. 66. Elsevier, pp. 274–289, 2013. ista: Dobi A, Sartori S, Busti D, Van Der Putten H, Singewald N, Shigemoto R, Ferraguti F. 2013. Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. 66, 274–289. mla: Dobi, Alice, et al. “Neural Substrates for the Distinct Effects of Presynaptic Group III Metabotropic Glutamate Receptors on Extinction of Contextual Fear Conditioning in Mice.” Neuropharmacology, vol. 66, Elsevier, 2013, pp. 274–89, doi:10.1016/j.neuropharm.2012.05.025. short: A. Dobi, S. Sartori, D. Busti, H. Van Der Putten, N. Singewald, R. Shigemoto, F. Ferraguti, Neuropharmacology 66 (2013) 274–289. date_created: 2018-12-11T11:59:06Z date_published: 2013-03-01T00:00:00Z date_updated: 2021-01-12T06:59:05Z day: '01' doi: 10.1016/j.neuropharm.2012.05.025 extern: 1 intvolume: ' 66' month: '03' page: 274 - 289 publication: Neuropharmacology publication_status: published publisher: Elsevier publist_id: '4205' quality_controlled: 0 status: public title: Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice type: journal_article volume: 66 year: '2013' ... --- _id: '2691' abstract: - lang: eng text: P/Q-type voltage-dependent calcium channels play key roles in transmitter release, integration of dendritic signals, generation of dendritic spikes, and gene expression. High intracellular calcium concentration transient produced by these channels is restricted to tens to hundreds of nanometers from the channels. Therefore, precise localization of these channels along the plasma membrane was long sought to decipher how each neuronal cell function is controlled. Here, we analyzed the distribution of Cav2.1 subunit of the P/Q-type channel using highly sensitive SDS-digested freeze-fracture replica labeling in the rat cerebellar Purkinje cells. The labeling efficiency was such that the number of immunogold particles in each parallel fiber active zone was comparable to that of functional channels calculated from previous reports. Two distinct patterns of Cav2.1 distribution, scattered and clustered, were found in Purkinje cells. The scattered Cav2.1 had a somatodendritic gradient with the density of immunogold particles increasing 2.5-fold from soma to distal dendrites. The other population with 74-fold higher density than the scattered particles was found within clusters of intramembrane particles on the P-face of soma and primary dendrites. Both populations of Cav2.1 were found as early as P3 and increased in the second postnatal week to a mature level. Using double immunogold labeling, we found that virtually all of the Cav2.1 clusters were colocalized with two types of calcium-activated potassium channels, BK and SK2, with the nearest neighbor distance of 40∼nm. Calcium nanodomain created by the opening of Cav2.1 channels likely activates the two channels that limit the extent of depolarization. author: - first_name: Dwi full_name: Indriati, Dwi Wahyu last_name: Indriati - first_name: Naomi full_name: Kamasawa, Naomi last_name: Kamasawa - first_name: Ko full_name: Matsui, Ko last_name: Matsui - first_name: Andrea full_name: Meredith, Andrea L last_name: Meredith - first_name: Masahiko full_name: Watanabe, Masahiko last_name: Watanabe - first_name: Ryuichi full_name: Ryuichi Shigemoto id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 citation: ama: 'Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. 2013;33(8):3668-3678. doi:10.1523/JNEUROSCI.2921-12.2013' apa: 'Indriati, D., Kamasawa, N., Matsui, K., Meredith, A., Watanabe, M., & Shigemoto, R. (2013). Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2921-12.2013' chicago: 'Indriati, Dwi, Naomi Kamasawa, Ko Matsui, Andrea Meredith, Masahiko Watanabe, and Ryuichi Shigemoto. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.2921-12.2013.' ieee: 'D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, and R. Shigemoto, “Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels,” Journal of Neuroscience, vol. 33, no. 8. Society for Neuroscience, pp. 3668–3678, 2013.' ista: 'Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. 2013. Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. 33(8), 3668–3678.' mla: 'Indriati, Dwi, et al. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience, vol. 33, no. 8, Society for Neuroscience, 2013, pp. 3668–78, doi:10.1523/JNEUROSCI.2921-12.2013.' short: D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, R. Shigemoto, Journal of Neuroscience 33 (2013) 3668–3678. date_created: 2018-12-11T11:59:05Z date_published: 2013-02-20T00:00:00Z date_updated: 2021-01-12T06:59:05Z day: '20' doi: 10.1523/JNEUROSCI.2921-12.2013 extern: 1 intvolume: ' 33' issue: '8' month: '02' page: 3668 - 3678 publication: Journal of Neuroscience publication_status: published publisher: Society for Neuroscience publist_id: '4206' quality_controlled: 0 status: public title: 'Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels' type: journal_article volume: 33 year: '2013' ... --- _id: '2690' abstract: - lang: eng text: Establishing the spatiotemporal concentration profile of neurotransmitter following synaptic vesicular release is essential for our understanding of inter-neuronal communication. Such profile is a determinant of synaptic strength, short-term plasticity and inter-synaptic crosstalk. Synaptically released glutamate has been suggested to reach a few millimolar in concentration and last for <1 ms. The synaptic cleft is often conceived as a single concentration compartment, whereas a huge gradient likely exists. Modelling studies have attempted to describe this gradient, but two key parameters, the number of glutamate in a vesicle (NGlu) and its diffusion coefficient (DGlu) in the extracellular space, remained unresolved. To determine this profile, the rat calyx of Held synapse at postnatal day 12-16 was studied where diffusion of glutamate occurs two-dimensionally and where quantification of AMPA receptor distribution on individual postsynaptic specialization on medial nucleus of the trapezoid body principal cells is possible using SDS-digested freeze-fracture replica labelling. To assess the performance of these receptors as glutamate sensors, a kinetic model of the receptors was constructed from outside-out patch recordings. From here, we simulated synaptic responses and compared them with the EPSC recordings. Combinations of NGlu and DGlu with an optimum of 7000 and 0.3 μm2 ms-1 reproduced the data, suggesting slow diffusion. Further simulations showed that a single vesicle does not saturate the synaptic receptors, and that glutamate spillover does not affect the conductance amplitude at this synapse. Using the estimated profile, we also evaluated how the number of multiple vesicle releases at individual active zones affects the amplitude of postsynaptic signals. author: - first_name: Timotheus full_name: Budisantoso, Timotheus last_name: Budisantoso - first_name: Harumi full_name: Harumi Harada id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87 last_name: Harada orcid: 0000-0001-7429-7896 - first_name: Naomi full_name: Kamasawa, Naomi last_name: Kamasawa - first_name: Yugo full_name: Fukazawa, Yugo last_name: Fukazawa - first_name: Ryuichi full_name: Ryuichi Shigemoto id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Ko full_name: Matsui, Ko last_name: Matsui citation: ama: Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. 2013;591(1):219-239. doi:10.1113/jphysiol.2012.241398 apa: Budisantoso, T., Harada, H., Kamasawa, N., Fukazawa, Y., Shigemoto, R., & Matsui, K. (2013). Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2012.241398 chicago: Budisantoso, Timotheus, Harumi Harada, Naomi Kamasawa, Yugo Fukazawa, Ryuichi Shigemoto, and Ko Matsui. “Evaluation of Glutamate Concentration Transient in the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology. Wiley-Blackwell, 2013. https://doi.org/10.1113/jphysiol.2012.241398. ieee: T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, and K. Matsui, “Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held,” Journal of Physiology, vol. 591, no. 1. Wiley-Blackwell, pp. 219–239, 2013. ista: Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. 2013. Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. 591(1), 219–239. mla: Budisantoso, Timotheus, et al. “Evaluation of Glutamate Concentration Transient in the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology, vol. 591, no. 1, Wiley-Blackwell, 2013, pp. 219–39, doi:10.1113/jphysiol.2012.241398. short: T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, K. Matsui, Journal of Physiology 591 (2013) 219–239. date_created: 2018-12-11T11:59:05Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:59:04Z day: '01' doi: 10.1113/jphysiol.2012.241398 extern: 1 intvolume: ' 591' issue: '1' month: '01' page: 219 - 239 publication: Journal of Physiology publication_status: published publisher: Wiley-Blackwell publist_id: '4207' quality_controlled: 0 status: public title: Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held type: journal_article volume: 591 year: '2013' ... --- _id: '2693' abstract: - lang: eng text: Inhibitory parvalbumin-containing interneurons (PVIs) control neuronal discharge and support the generation of theta- and gammafrequency oscillations in cortical networks. Fast GABAergic input onto PVIs is crucial for their synchronization and oscillatory entrainment, but the role of metabotropic GABAB receptors (GABABRs) in mediating slow presynaptic and postsynaptic inhibition remains unknown. In this study, we have combined high-resolution immunoelectron microscopy, whole-cell patch-clamp recording, and computational modeling to investigate the subcellular distribution and effects of GABABRs and their postsynaptic effector Kir3 channels in rat hippocampal PVIs. Pre-embedding immunogold labeling revealed that the receptors and channels localize at high levels to the extrasynaptic membrane of parvalbumin-immunoreactive dendrites. Immunoreactivity forGABABRs was also present at lower levels on PVI axon terminals. Whole-cell recordings further showed that synaptically released GABA in response to extracellular stimulation evokes large GABABR-mediated slow IPSCs in perisomatic-targeting (PT) PVIs, but only small or no currents in dendrite-targeting (DT) PVIs. In contrast, paired recordings demonstrated that GABABR activation results in presynaptic inhibition at the output synapses of both PT and DT PVIs, but more strongly in the latter. Finally, computational analysis indicated that GABAB IPSCs can phasically modulate the discharge of PT interneurons at theta frequencies. In summary, our results show that GABABRs differentially mediate slow presynaptic and postsynaptic inhibition in PVIs and can contribute to the dynamic modulation of their activity during oscillations. Furthermore, these data provide evidence for a compartment-specific molecular divergence of hippocampal PVI subtypes, suggesting that activation of GABABRs may shift the balance between perisomatic and dendritic inhibition. author: - first_name: Sam full_name: Booker, Sam A last_name: Booker - first_name: Anna full_name: Gross, Anna last_name: Gross - first_name: Daniel full_name: Althof, Daniel last_name: Althof - first_name: Ryuichi full_name: Ryuichi Shigemoto id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Bernhard full_name: Bettler, Bernhard last_name: Bettler - first_name: Michael full_name: Frotscher, Michael last_name: Frotscher - first_name: Matthew full_name: Hearing, Matthew C last_name: Hearing - first_name: Kevin full_name: Wickman, Kevin D last_name: Wickman - first_name: Masahiko full_name: Watanabe, Masahiko last_name: Watanabe - first_name: Ákos full_name: Kulik, Ákos last_name: Kulik - first_name: Imre full_name: Vida, Imre last_name: Vida citation: ama: Booker S, Gross A, Althof D, et al. Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. 2013;33(18):7961-7974. doi:10.1523/JNEUROSCI.1186-12.2013 apa: Booker, S., Gross, A., Althof, D., Shigemoto, R., Bettler, B., Frotscher, M., … Vida, I. (2013). Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1186-12.2013 chicago: Booker, Sam, Anna Gross, Daniel Althof, Ryuichi Shigemoto, Bernhard Bettler, Michael Frotscher, Matthew Hearing, et al. “Differential GABAB-Receptor-Mediated Effects in Perisomatic- and Dendrite-Targeting Parvalbumin Interneurons.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.1186-12.2013. ieee: S. Booker et al., “Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons,” Journal of Neuroscience, vol. 33, no. 18. Society for Neuroscience, pp. 7961–7974, 2013. ista: Booker S, Gross A, Althof D, Shigemoto R, Bettler B, Frotscher M, Hearing M, Wickman K, Watanabe M, Kulik Á, Vida I. 2013. Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. 33(18), 7961–7974. mla: Booker, Sam, et al. “Differential GABAB-Receptor-Mediated Effects in Perisomatic- and Dendrite-Targeting Parvalbumin Interneurons.” Journal of Neuroscience, vol. 33, no. 18, Society for Neuroscience, 2013, pp. 7961–74, doi:10.1523/JNEUROSCI.1186-12.2013. short: S. Booker, A. Gross, D. Althof, R. Shigemoto, B. Bettler, M. Frotscher, M. Hearing, K. Wickman, M. Watanabe, Á. Kulik, I. Vida, Journal of Neuroscience 33 (2013) 7961–7974. date_created: 2018-12-11T11:59:06Z date_published: 2013-05-01T00:00:00Z date_updated: 2021-01-12T06:59:05Z day: '01' doi: 10.1523/JNEUROSCI.1186-12.2013 extern: 1 intvolume: ' 33' issue: '18' month: '05' page: 7961 - 7974 publication: Journal of Neuroscience publication_status: published publisher: Society for Neuroscience publist_id: '4204' quality_controlled: 0 status: public title: Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons type: journal_article volume: 33 year: '2013' ... --- _id: '2698' abstract: - lang: eng text: We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator. author: - 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: Søren full_name: Fournais, Søren last_name: Fournais - first_name: Jan full_name: Solovej, Jan last_name: Solovej citation: ama: Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 2013;15(6):2093-2113. doi:10.4171/JEMS/416 apa: Erdös, L., Fournais, S., & Solovej, J. (2013). Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. European Mathematical Society. https://doi.org/10.4171/JEMS/416 chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics in Self-Generated Fields.” Journal of the European Mathematical Society. European Mathematical Society, 2013. https://doi.org/10.4171/JEMS/416. ieee: L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated fields,” Journal of the European Mathematical Society, vol. 15, no. 6. European Mathematical Society, pp. 2093–2113, 2013. ista: Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 15(6), 2093–2113. mla: Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.” Journal of the European Mathematical Society, vol. 15, no. 6, European Mathematical Society, 2013, pp. 2093–113, doi:10.4171/JEMS/416. short: L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society 15 (2013) 2093–2113. date_created: 2018-12-11T11:59:07Z date_published: 2013-10-16T00:00:00Z date_updated: 2021-01-12T06:59:07Z day: '16' department: - _id: LaEr doi: 10.4171/JEMS/416 external_id: arxiv: - '1105.0506' intvolume: ' 15' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1105.0506 month: '10' oa: 1 oa_version: Preprint page: 2093 - 2113 publication: Journal of the European Mathematical Society publication_status: published publisher: European Mathematical Society publist_id: '4198' quality_controlled: '1' status: public title: Stability and semiclassics in self-generated fields type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2013' ... --- _id: '2697' abstract: - lang: eng text: We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1 d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z / L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2 s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the band width W. In one dimension we prove that the eigenvectors of H are delocalized if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries |Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1 is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞ L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed by a diffusion operator whose diffusion constant we compute. Similar results are obtained in higher dimensions. author: - first_name: László full_name: László Erdös id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Antti full_name: Knowles, Antti last_name: Knowles - first_name: Horng full_name: Yau, Horng-Tzer last_name: Yau - first_name: Jun full_name: Yin, Jun last_name: Yin citation: ama: Erdös L, Knowles A, Yau H, Yin J. Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. 2013;323(1):367-416. doi:10.1007/s00220-013-1773-3 apa: Erdös, L., Knowles, A., Yau, H., & Yin, J. (2013). Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1773-3 chicago: Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Delocalization and Diffusion Profile for Random Band Matrices.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1773-3. ieee: L. Erdös, A. Knowles, H. Yau, and J. Yin, “Delocalization and diffusion profile for random band matrices,” Communications in Mathematical Physics, vol. 323, no. 1. Springer, pp. 367–416, 2013. ista: Erdös L, Knowles A, Yau H, Yin J. 2013. Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. 323(1), 367–416. mla: Erdös, László, et al. “Delocalization and Diffusion Profile for Random Band Matrices.” Communications in Mathematical Physics, vol. 323, no. 1, Springer, 2013, pp. 367–416, doi:10.1007/s00220-013-1773-3. short: L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics 323 (2013) 367–416. date_created: 2018-12-11T11:59:07Z date_published: 2013-10-01T00:00:00Z date_updated: 2021-01-12T06:59:07Z day: '01' doi: 10.1007/s00220-013-1773-3 extern: 1 intvolume: ' 323' issue: '1' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1205.5669 month: '10' oa: 1 page: 367 - 416 publication: Communications in Mathematical Physics publication_status: published publisher: Springer publist_id: '4199' quality_controlled: 0 status: public title: Delocalization and diffusion profile for random band matrices type: journal_article volume: 323 year: '2013' ... --- _id: '2718' abstract: - lang: eng text: Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C. author: - 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: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 citation: ama: 'Barton NH, Paixao T. Can quantitative and population genetics help us understand evolutionary computation? In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM; 2013:1573-1580. doi:10.1145/2463372.2463568' apa: 'Barton, N. H., & Paixao, T. (2013). Can quantitative and population genetics help us understand evolutionary computation? In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 1573–1580). Amsterdam, Netherlands: ACM. https://doi.org/10.1145/2463372.2463568' chicago: Barton, Nicholas H, and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, 1573–80. ACM, 2013. https://doi.org/10.1145/2463372.2463568. ieee: N. H. Barton and T. Paixao, “Can quantitative and population genetics help us understand evolutionary computation?,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation, Amsterdam, Netherlands, 2013, pp. 1573–1580. ista: 'Barton NH, Paixao T. 2013. Can quantitative and population genetics help us understand evolutionary computation? Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 1573–1580.' mla: Barton, Nicholas H., and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–80, doi:10.1145/2463372.2463568. short: N.H. Barton, T. Paixao, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–1580. conference: end_date: 2013-07-10 location: Amsterdam, Netherlands name: 'GECCO: Genetic and evolutionary computation conference' start_date: 2013-07-06 date_created: 2018-12-11T11:59:14Z date_published: 2013-07-01T00:00:00Z date_updated: 2021-01-12T06:59:15Z day: '01' ddc: - '570' department: - _id: NiBa - _id: CaGu doi: 10.1145/2463372.2463568 ec_funded: 1 file: - access_level: open_access checksum: 9d9be9090ce5c20766e0eb076ace5b98 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:38Z date_updated: 2020-07-14T12:45:45Z file_id: '5159' file_name: IST-2016-564-v1+1_NickGECCO_2013_1_-1.pdf file_size: 475844 relation: main_file file_date_updated: 2020-07-14T12:45:45Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 1573 - 1580 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Proceedings of the 15th annual conference on Genetic and evolutionary computation publication_status: published publisher: ACM publist_id: '4174' pubrep_id: '564' quality_controlled: '1' scopus_import: 1 status: public title: Can quantitative and population genetics help us understand evolutionary computation? type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2720' abstract: - lang: eng text: 'Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is <10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes.' article_processing_charge: No author: - first_name: Hongan full_name: Long, Hongan last_name: Long - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 - first_name: Ricardo full_name: Azevedo, Ricardo last_name: Azevedo - first_name: Rebecca full_name: Zufall, Rebecca last_name: Zufall citation: ama: Long H, Paixao T, Azevedo R, Zufall R. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. 2013;195(2):527-540. doi:10.1534/genetics.113.153536 apa: Long, H., Paixao, T., Azevedo, R., & Zufall, R. (2013). Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.113.153536 chicago: Long, Hongan, Tiago Paixao, Ricardo Azevedo, and Rebecca Zufall. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” Genetics. Genetics Society of America, 2013. https://doi.org/10.1534/genetics.113.153536. ieee: H. Long, T. Paixao, R. Azevedo, and R. Zufall, “Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila,” Genetics, vol. 195, no. 2. Genetics Society of America, pp. 527–540, 2013. ista: Long H, Paixao T, Azevedo R, Zufall R. 2013. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. 195(2), 527–540. mla: Long, Hongan, et al. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” Genetics, vol. 195, no. 2, Genetics Society of America, 2013, pp. 527–40, doi:10.1534/genetics.113.153536. short: H. Long, T. Paixao, R. Azevedo, R. Zufall, Genetics 195 (2013) 527–540. date_created: 2018-12-11T11:59:15Z date_published: 2013-10-01T00:00:00Z date_updated: 2021-01-12T06:59:16Z day: '01' department: - _id: NiBa - _id: CaGu doi: 10.1534/genetics.113.153536 ec_funded: 1 external_id: pmid: - '23934880' intvolume: ' 195' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781978/ month: '10' oa: 1 oa_version: Submitted Version page: 527-540 pmid: 1 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Genetics publication_status: published publisher: Genetics Society of America publist_id: '4172' quality_controlled: '1' scopus_import: 1 status: public title: Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 195 year: '2013' ... --- _id: '2719' abstract: - lang: eng text: Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation. author: - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 - 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: 'Paixao T, Barton NH. A variance decomposition approach to the analysis of genetic algorithms. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM; 2013:845-852. doi:10.1145/2463372.2463470' apa: 'Paixao, T., & Barton, N. H. (2013). A variance decomposition approach to the analysis of genetic algorithms. In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 845–852). Amsterdam, Netherlands: ACM. https://doi.org/10.1145/2463372.2463470' chicago: Paixao, Tiago, and Nicholas H Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, 845–52. ACM, 2013. https://doi.org/10.1145/2463372.2463470. ieee: T. Paixao and N. H. Barton, “A variance decomposition approach to the analysis of genetic algorithms,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation, Amsterdam, Netherlands, 2013, pp. 845–852. ista: 'Paixao T, Barton NH. 2013. A variance decomposition approach to the analysis of genetic algorithms. Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 845–852.' mla: Paixao, Tiago, and Nicholas H. Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–52, doi:10.1145/2463372.2463470. short: T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852. conference: end_date: 2013-07-10 location: Amsterdam, Netherlands name: 'GECCO: Genetic and evolutionary computation conference' start_date: 2013-07-06 date_created: 2018-12-11T11:59:15Z date_published: 2013-07-01T00:00:00Z date_updated: 2021-01-12T06:59:15Z day: '01' department: - _id: NiBa - _id: CaGu doi: 10.1145/2463372.2463470 ec_funded: 1 language: - iso: eng month: '07' oa_version: None page: 845 - 852 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Proceedings of the 15th annual conference on Genetic and evolutionary computation publication_status: published publisher: ACM publist_id: '4173' quality_controlled: '1' scopus_import: 1 status: public title: A variance decomposition approach to the analysis of genetic algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2782' abstract: - lang: eng text: We consider random n×n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are known as MANOVA matrices and which have joint eigenvalue density given by the third classical ensemble, the Jacobi ensemble. We show that, away from the spectral edge, the eigenvalue density converges to the limiting density of the Jacobi ensemble even on the shortest possible scales of order 1/n (up to log n factors). This result is the analogue of the local Wigner semicircle law and the local Marchenko-Pastur law for general MANOVA matrices. author: - 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: Brendan full_name: Farrell, Brendan last_name: Farrell citation: ama: Erdös L, Farrell B. Local eigenvalue density for general MANOVA matrices. Journal of Statistical Physics. 2013;152(6):1003-1032. doi:10.1007/s10955-013-0807-8 apa: Erdös, L., & Farrell, B. (2013). Local eigenvalue density for general MANOVA matrices. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-013-0807-8 chicago: Erdös, László, and Brendan Farrell. “Local Eigenvalue Density for General MANOVA Matrices.” Journal of Statistical Physics. Springer, 2013. https://doi.org/10.1007/s10955-013-0807-8. ieee: L. Erdös and B. Farrell, “Local eigenvalue density for general MANOVA matrices,” Journal of Statistical Physics, vol. 152, no. 6. Springer, pp. 1003–1032, 2013. ista: Erdös L, Farrell B. 2013. Local eigenvalue density for general MANOVA matrices. Journal of Statistical Physics. 152(6), 1003–1032. mla: Erdös, László, and Brendan Farrell. “Local Eigenvalue Density for General MANOVA Matrices.” Journal of Statistical Physics, vol. 152, no. 6, Springer, 2013, pp. 1003–32, doi:10.1007/s10955-013-0807-8. short: L. Erdös, B. Farrell, Journal of Statistical Physics 152 (2013) 1003–1032. date_created: 2018-12-11T11:59:34Z date_published: 2013-07-18T00:00:00Z date_updated: 2021-01-12T06:59:41Z day: '18' department: - _id: LaEr doi: 10.1007/s10955-013-0807-8 external_id: arxiv: - '1207.0031' intvolume: ' 152' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1207.0031 month: '07' oa: 1 oa_version: Preprint page: 1003 - 1032 publication: Journal of Statistical Physics publication_status: published publisher: Springer publist_id: '4107' quality_controlled: '1' scopus_import: 1 status: public title: Local eigenvalue density for general MANOVA matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 152 year: '2013' ... --- _id: '2781' abstract: - lang: eng text: 'We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, that is, graphs on N vertices where every edge is chosen independently and with probability p = p(N). We rescale the matrix so that its bulk eigenvalues are of order one. We prove that, as long as pN→∞(with a speed at least logarithmic in N), the density of eigenvalues of the Erdős-Rényi ensemble is given by the Wigner semicircle law for spectral windows of length larger than N-1 (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the ℓ∞-norms of the ℓ2-normalized eigenvectors are at most of order N-1/2 with a very high probability. The estimates in this paper will be used in the companion paper [Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues (2011) Preprint] to prove the universality of eigenvalue distributions both in the bulk and at the spectral edges under the further restriction that pN »N2/3.' author: - first_name: László full_name: László Erdös id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Antti full_name: Knowles, Antti last_name: Knowles - first_name: Horng full_name: Yau, Horng-Tzer last_name: Yau - first_name: Jun full_name: Yin, Jun last_name: Yin citation: ama: 'Erdös L, Knowles A, Yau H, Yin J. Spectral statistics of Erdős-Rényi graphs I: Local semicircle law. Annals of Probability. 2013;41(3 B):2279-2375. doi:10.1214/11-AOP734' apa: 'Erdös, L., Knowles, A., Yau, H., & Yin, J. (2013). Spectral statistics of Erdős-Rényi graphs I: Local semicircle law. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/11-AOP734' chicago: 'Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Spectral Statistics of Erdős-Rényi Graphs I: Local Semicircle Law.” Annals of Probability. Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/11-AOP734.' ieee: 'L. Erdös, A. Knowles, H. Yau, and J. Yin, “Spectral statistics of Erdős-Rényi graphs I: Local semicircle law,” Annals of Probability, vol. 41, no. 3 B. Institute of Mathematical Statistics, pp. 2279–2375, 2013.' ista: 'Erdös L, Knowles A, Yau H, Yin J. 2013. Spectral statistics of Erdős-Rényi graphs I: Local semicircle law. Annals of Probability. 41(3 B), 2279–2375.' mla: 'Erdös, László, et al. “Spectral Statistics of Erdős-Rényi Graphs I: Local Semicircle Law.” Annals of Probability, vol. 41, no. 3 B, Institute of Mathematical Statistics, 2013, pp. 2279–375, doi:10.1214/11-AOP734.' short: L. Erdös, A. Knowles, H. Yau, J. Yin, Annals of Probability 41 (2013) 2279–2375. date_created: 2018-12-11T11:59:34Z date_published: 2013-05-01T00:00:00Z date_updated: 2021-01-12T06:59:41Z day: '01' doi: 10.1214/11-AOP734 extern: 1 intvolume: ' 41' issue: 3 B main_file_link: - open_access: '1' url: http://arxiv.org/abs/1103.1919 month: '05' oa: 1 page: 2279 - 2375 publication: Annals of Probability publication_status: published publisher: Institute of Mathematical Statistics publist_id: '4109' quality_controlled: 0 status: public title: 'Spectral statistics of Erdős-Rényi graphs I: Local semicircle law' type: journal_article volume: 41 year: '2013' ... --- _id: '2780' abstract: - lang: eng text: We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix entries. Our results generalize the previous results of Erdős et al. (Ann Probab, arXiv:1103.1919, 2013; Commun Math Phys, arXiv:1103.3869, 2013; J Combin 1(2):15-85, 2011) which constituted a key step in the proof of the local semicircle law with optimal error bound in mean-field random matrix models. Our bounds apply to random band matrices and improve previous estimates from order 2 to order 4 in the cases relevant to applications. In particular, they lead to a proof of the diffusion approximation for the magnitude of the resolvent of random band matrices. This, in turn, implies new delocalization bounds on the eigenvectors. The applications are presented in a separate paper (Erdős et al., arXiv:1205.5669, 2013). author: - first_name: László full_name: László Erdös id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Antti full_name: Knowles, Antti last_name: Knowles - first_name: Horng full_name: Yau, Horng-Tzer last_name: Yau citation: ama: Erdös L, Knowles A, Yau H. Averaging fluctuations in resolvents of random band matrices. Annales Henri Poincare. 2013;14(8):1837-1926. doi:10.1007/s00023-013-0235-y apa: Erdös, L., Knowles, A., & Yau, H. (2013). Averaging fluctuations in resolvents of random band matrices. Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-013-0235-y chicago: Erdös, László, Antti Knowles, and Horng Yau. “Averaging Fluctuations in Resolvents of Random Band Matrices.” Annales Henri Poincare. Birkhäuser, 2013. https://doi.org/10.1007/s00023-013-0235-y. ieee: L. Erdös, A. Knowles, and H. Yau, “Averaging fluctuations in resolvents of random band matrices,” Annales Henri Poincare, vol. 14, no. 8. Birkhäuser, pp. 1837–1926, 2013. ista: Erdös L, Knowles A, Yau H. 2013. Averaging fluctuations in resolvents of random band matrices. Annales Henri Poincare. 14(8), 1837–1926. mla: Erdös, László, et al. “Averaging Fluctuations in Resolvents of Random Band Matrices.” Annales Henri Poincare, vol. 14, no. 8, Birkhäuser, 2013, pp. 1837–926, doi:10.1007/s00023-013-0235-y. short: L. Erdös, A. Knowles, H. Yau, Annales Henri Poincare 14 (2013) 1837–1926. date_created: 2018-12-11T11:59:33Z date_published: 2013-12-01T00:00:00Z date_updated: 2021-01-12T06:59:40Z day: '01' doi: 10.1007/s00023-013-0235-y extern: 1 intvolume: ' 14' issue: '8' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1205.5664 month: '12' oa: 1 page: 1837 - 1926 publication: Annales Henri Poincare publication_status: published publisher: Birkhäuser publist_id: '4110' quality_controlled: 0 status: public title: Averaging fluctuations in resolvents of random band matrices type: journal_article volume: 14 year: '2013' ... --- _id: '2807' abstract: - lang: eng text: 'We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov''s result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \no holes up to dimension k-1" (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. ' author: - first_name: Martin full_name: Čadek, Martin last_name: Čadek - first_name: Marek full_name: Krcál, Marek id: 33E21118-F248-11E8-B48F-1D18A9856A87 last_name: Krcál - first_name: Jiří full_name: Matoušek, Jiří last_name: Matoušek - first_name: Lukáš full_name: Vokřínek, Lukáš last_name: Vokřínek - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: 45th Annual ACM Symposium on Theory of Computing. ACM; 2013:595-604. doi:10.1145/2488608.2488683' apa: 'Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., & Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683' chicago: 'Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In 45th Annual ACM Symposium on Theory of Computing, 595–604. ACM, 2013. https://doi.org/10.1145/2488608.2488683.' ieee: 'M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.' ista: 'Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.' mla: 'Čadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.” 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604, doi:10.1145/2488608.2488683.' short: M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604. conference: end_date: 2013-06-04 location: Palo Alto, CA, United States name: 'STOC: Symposium on the Theory of Computing' start_date: 2013-06-01 date_created: 2018-12-11T11:59:42Z date_published: 2013-06-01T00:00:00Z date_updated: 2021-01-12T06:59:51Z day: '01' ddc: - '510' department: - _id: UlWa - _id: HeEd doi: 10.1145/2488608.2488683 file: - access_level: open_access checksum: 06c2ce5c1135fbc1f71ca15eeb242dcf content_type: application/pdf creator: system date_created: 2018-12-12T10:14:29Z date_updated: 2020-07-14T12:45:48Z file_id: '5081' file_name: IST-2016-533-v1+1_Extending_continuous_maps_polynomiality_and_undecidability.pdf file_size: 447945 relation: main_file file_date_updated: 2020-07-14T12:45:48Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 595 - 604 publication: 45th Annual ACM Symposium on theory of computing publication_status: published publisher: ACM publist_id: '4078' pubrep_id: '533' quality_controlled: '1' scopus_import: 1 status: public title: 'Extending continuous maps: Polynomiality and undecidability' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '2808' abstract: - lang: eng text: In order to establish a reference for analysis of the function of auxin and the auxin biosynthesis regulators SHORT INTERNODE/ STYLISH (SHI/STY) during Physcomitrella patens reproductive development, we have described male (antheridial) and female (archegonial) development in detail, including temporal and positional information of organ initiation. This has allowed us to define discrete stages of organ morphogenesis and to show that reproductive organ development in P. patens is highly organized and that organ phyllotaxis differs between vegetative and reproductive development. Using the PpSHI1 and PpSHI2 reporter and knockout lines, the auxin reporters GmGH3pro:GUS and PpPINApro:GFP-GUS, and the auxin-conjugating transgene PpSHI2pro:IAAL, we could show that the PpSHI genes, and by inference also auxin, play important roles for reproductive organ development in moss. The PpSHI genes are required for the apical opening of the reproductive organs, the final differentiation of the egg cell, and the progression of canal cells into a cell death program. The apical cells of the archegonium, the canal cells, and the egg cell are also sites of auxin responsiveness and are affected by reduced levels of active auxin, suggesting that auxin mediates PpSHI function in the reproductive organs. author: - first_name: Katarina full_name: Landberg, Katarina last_name: Landberg - first_name: Eric full_name: Pederson, Eric last_name: Pederson - first_name: Tom full_name: Viaene, Tom last_name: Viaene - first_name: Behruz full_name: Bozorg, Behruz last_name: Bozorg - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Henrik full_name: Jönsson, Henrik last_name: Jönsson - first_name: Mattias full_name: Thelander, Mattias last_name: Thelander - first_name: Eva full_name: Sundberg, Eva last_name: Sundberg citation: ama: Landberg K, Pederson E, Viaene T, et al. The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. Plant Physiology. 2013;162(3):1406-1419. doi:10.1104/pp.113.214023 apa: Landberg, K., Pederson, E., Viaene, T., Bozorg, B., Friml, J., Jönsson, H., … Sundberg, E. (2013). The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.113.214023 chicago: Landberg, Katarina, Eric Pederson, Tom Viaene, Behruz Bozorg, Jiří Friml, Henrik Jönsson, Mattias Thelander, and Eva Sundberg. “The Moss Physcomitrella Patens Reproductive Organ Development Is Highly Organized, Affected by the Two SHI/STY Genes and by the Level of Active Auxin in the SHI/STY Expression Domain.” Plant Physiology. American Society of Plant Biologists, 2013. https://doi.org/10.1104/pp.113.214023. ieee: K. Landberg et al., “The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain,” Plant Physiology, vol. 162, no. 3. American Society of Plant Biologists, pp. 1406–1419, 2013. ista: Landberg K, Pederson E, Viaene T, Bozorg B, Friml J, Jönsson H, Thelander M, Sundberg E. 2013. The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. Plant Physiology. 162(3), 1406–1419. mla: Landberg, Katarina, et al. “The Moss Physcomitrella Patens Reproductive Organ Development Is Highly Organized, Affected by the Two SHI/STY Genes and by the Level of Active Auxin in the SHI/STY Expression Domain.” Plant Physiology, vol. 162, no. 3, American Society of Plant Biologists, 2013, pp. 1406–19, doi:10.1104/pp.113.214023. short: K. Landberg, E. Pederson, T. Viaene, B. Bozorg, J. Friml, H. Jönsson, M. Thelander, E. Sundberg, Plant Physiology 162 (2013) 1406–1419. date_created: 2018-12-11T11:59:42Z date_published: 2013-07-03T00:00:00Z date_updated: 2021-01-12T06:59:51Z day: '03' department: - _id: JiFr doi: 10.1104/pp.113.214023 external_id: pmid: - '23669745' intvolume: ' 162' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3707547/ month: '07' oa: 1 oa_version: Submitted Version page: 1406 - 1419 pmid: 1 publication: Plant Physiology publication_status: published publisher: American Society of Plant Biologists publist_id: '4079' quality_controlled: '1' scopus_import: 1 status: public title: The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 162 year: '2013' ... --- _id: '2806' abstract: - lang: eng text: A novel Taylor-Couette system has been constructed for investigations of transitional as well as high Reynolds number turbulent flows in very large aspect ratios. The flexibility of the setup enables studies of a variety of problems regarding hydrodynamic instabilities and turbulence in rotating flows. The inner and outer cylinders and the top and bottom endplates can be rotated independently with rotation rates of up to 30 Hz, thereby covering five orders of magnitude in Reynolds numbers (Re = 101-106). The radius ratio can be easily changed, the highest realized one is η = 0.98 corresponding to an aspect ratio of 260 gap width in the vertical and 300 in the azimuthal direction. For η < 0.98 the aspect ratio can be dynamically changed during measurements and complete transparency in the radial direction over the full length of the cylinders is provided by the usage of a precision glass inner cylinder. The temperatures of both cylinders are controlled independently. Overall this apparatus combines an unmatched variety in geometry, rotation rates, and temperatures, which is provided by a sophisticated high-precision bearing system. Possible applications are accurate studies of the onset of turbulence and spatio-temporal intermittent flow patterns in very large domains, transport processes of turbulence at high Re, the stability of Keplerian flows for different boundary conditions, and studies of baroclinic instabilities. article_number: '065106' author: - first_name: Kerstin full_name: Avila, Kerstin last_name: Avila - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Avila K, Hof B. High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. Review of Scientific Instruments. 2013;84(6). doi:10.1063/1.4807704 apa: Avila, K., & Hof, B. (2013). High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. Review of Scientific Instruments. American Institute of Physics. https://doi.org/10.1063/1.4807704 chicago: Avila, Kerstin, and Björn Hof. “High-Precision Taylor-Couette Experiment to Study Subcritical Transitions and the Role of Boundary Conditions and Size Effects.” Review of Scientific Instruments. American Institute of Physics, 2013. https://doi.org/10.1063/1.4807704. ieee: K. Avila and B. Hof, “High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects,” Review of Scientific Instruments, vol. 84, no. 6. American Institute of Physics, 2013. ista: Avila K, Hof B. 2013. High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. Review of Scientific Instruments. 84(6), 065106. mla: Avila, Kerstin, and Björn Hof. “High-Precision Taylor-Couette Experiment to Study Subcritical Transitions and the Role of Boundary Conditions and Size Effects.” Review of Scientific Instruments, vol. 84, no. 6, 065106, American Institute of Physics, 2013, doi:10.1063/1.4807704. short: K. Avila, B. Hof, Review of Scientific Instruments 84 (2013). date_created: 2018-12-11T11:59:42Z date_published: 2013-06-06T00:00:00Z date_updated: 2021-01-12T06:59:50Z day: '06' department: - _id: BjHo doi: 10.1063/1.4807704 intvolume: ' 84' issue: '6' language: - iso: eng month: '06' oa_version: None publication: Review of Scientific Instruments publication_status: published publisher: American Institute of Physics publist_id: '4081' quality_controlled: '1' scopus_import: 1 status: public title: High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 84 year: '2013' ... --- _id: '2805' abstract: - lang: eng text: Transition in shear flows is characterized by localized turbulent regions embedded in the surrounding laminar flow. These so-called turbulent spots or puffs are observed in a variety of shear flows and in certain Reynolds-number regimes, and they are advected by the flow while keeping their characteristic length. We show here for the case of pipe flow that this seemingly passive advection of turbulent puffs involves continuous entrainment and relaminarization of laminar and turbulent fluid across strongly convoluted interfaces. Surprisingly, interface areas are almost two orders of magnitude larger than the pipe cross-section, while local entrainment velocities are much smaller than the mean speed. Even though these velocities were shown to be small and proportional to the Kolmogorov velocity scale (in agreement with a prediction by Corrsin) in a flow without mean shear before, we find that, in pipe flow, local entrainment velocities are about an order of magnitude smaller than this scale. The Lagrangian method used to study the dynamics of the laminar-turbulent interfaces allows accurate determination of the leading and trailing edge speeds. However, to resolve the highly complex interface dynamics requires much higher numerical resolutions than for ordinary turbulent flows. This method also reveals that the volume flux across the leading edge has the same radial dependence but the opposite sign as that across the trailing edge, and it is this symmetry that is responsible for the puff shape remaining constant. author: - first_name: Markus full_name: Holzner, Markus last_name: Holzner - first_name: Baofang full_name: Song, Baofang last_name: Song - first_name: Marc full_name: Avila, Marc last_name: Avila - first_name: Björn full_name: Björn Hof id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Holzner M, Song B, Avila M, Hof B. Lagrangian approach to laminar-turbulent interfaces in transitional pipe flow. Journal of Fluid Mechanics. 2013;723:140-162. doi:10.1017/jfm.2013.127 apa: Holzner, M., Song, B., Avila, M., & Hof, B. (2013). Lagrangian approach to laminar-turbulent interfaces in transitional pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2013.127 chicago: Holzner, Markus, Baofang Song, Marc Avila, and Björn Hof. “Lagrangian Approach to Laminar-Turbulent Interfaces in Transitional Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2013. https://doi.org/10.1017/jfm.2013.127. ieee: M. Holzner, B. Song, M. Avila, and B. Hof, “Lagrangian approach to laminar-turbulent interfaces in transitional pipe flow,” Journal of Fluid Mechanics, vol. 723. Cambridge University Press, pp. 140–162, 2013. ista: Holzner M, Song B, Avila M, Hof B. 2013. Lagrangian approach to laminar-turbulent interfaces in transitional pipe flow. Journal of Fluid Mechanics. 723, 140–162. mla: Holzner, Markus, et al. “Lagrangian Approach to Laminar-Turbulent Interfaces in Transitional Pipe Flow.” Journal of Fluid Mechanics, vol. 723, Cambridge University Press, 2013, pp. 140–62, doi:10.1017/jfm.2013.127. short: M. Holzner, B. Song, M. Avila, B. Hof, Journal of Fluid Mechanics 723 (2013) 140–162. date_created: 2018-12-11T11:59:41Z date_published: 2013-05-01T00:00:00Z date_updated: 2021-01-12T06:59:50Z day: '01' doi: 10.1017/jfm.2013.127 extern: 1 intvolume: ' 723' month: '05' page: 140 - 162 publication: Journal of Fluid Mechanics publication_status: published publisher: Cambridge University Press publist_id: '4084' quality_controlled: 0 status: public title: Lagrangian approach to laminar-turbulent interfaces in transitional pipe flow type: journal_article volume: 723 year: '2013' ... --- _id: '2810' abstract: - lang: eng text: The epistatic interactions that underlie evolutionary constraint have mainly been studied for constant external conditions. However, environmental changes may modulate epistasis and hence affect genetic constraints. Here we investigate genetic constraints in the adaptive evolution of a novel regulatory function in variable environments, using the lac repressor, LacI, as a model system. We have systematically reconstructed mutational trajectories from wild type LacI to three different variants that each exhibit an inverse response to the inducing ligand IPTG, and analyzed the higher-order interactions between genetic and environmental changes. We find epistasis to depend strongly on the environment. As a result, mutational steps essential to inversion but inaccessible by positive selection in one environment, become accessible in another. We present a graphical method to analyze the observed complex higher-order interactions between multiple mutations and environmental change, and show how the interactions can be explained by a combination of mutational effects on allostery and thermodynamic stability. This dependency of genetic constraint on the environment should fundamentally affect evolutionary dynamics and affects the interpretation of phylogenetic data. article_number: e1003580 author: - first_name: Marjon full_name: De Vos, Marjon id: 3111FFAC-F248-11E8-B48F-1D18A9856A87 last_name: De Vos - first_name: Frank full_name: Poelwijk, Frank last_name: Poelwijk - first_name: Nico full_name: Battich, Nico last_name: Battich - first_name: Joseph full_name: Ndika, Joseph last_name: Ndika - first_name: Sander full_name: Tans, Sander last_name: Tans citation: ama: de Vos M, Poelwijk F, Battich N, Ndika J, Tans S. Environmental dependence of genetic constraint. PLoS Genetics. 2013;9(6). doi:10.1371/journal.pgen.1003580 apa: de Vos, M., Poelwijk, F., Battich, N., Ndika, J., & Tans, S. (2013). Environmental dependence of genetic constraint. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1003580 chicago: Vos, Marjon de, Frank Poelwijk, Nico Battich, Joseph Ndika, and Sander Tans. “Environmental Dependence of Genetic Constraint.” PLoS Genetics. Public Library of Science, 2013. https://doi.org/10.1371/journal.pgen.1003580. ieee: M. de Vos, F. Poelwijk, N. Battich, J. Ndika, and S. Tans, “Environmental dependence of genetic constraint,” PLoS Genetics, vol. 9, no. 6. Public Library of Science, 2013. ista: de Vos M, Poelwijk F, Battich N, Ndika J, Tans S. 2013. Environmental dependence of genetic constraint. PLoS Genetics. 9(6), e1003580. mla: de Vos, Marjon, et al. “Environmental Dependence of Genetic Constraint.” PLoS Genetics, vol. 9, no. 6, e1003580, Public Library of Science, 2013, doi:10.1371/journal.pgen.1003580. short: M. de Vos, F. Poelwijk, N. Battich, J. Ndika, S. Tans, PLoS Genetics 9 (2013). date_created: 2018-12-11T11:59:43Z date_published: 2013-06-27T00:00:00Z date_updated: 2021-01-12T06:59:52Z day: '27' ddc: - '570' department: - _id: ToBo doi: 10.1371/journal.pgen.1003580 file: - access_level: open_access checksum: 7a4736dd80496d29ff6908b6f2329b4e content_type: application/pdf creator: system date_created: 2018-12-12T10:08:51Z date_updated: 2020-07-14T12:45:48Z file_id: '4713' file_name: IST-2016-412-v1+1_journal.pgen.1003580.pdf file_size: 474655 relation: main_file file_date_updated: 2020-07-14T12:45:48Z has_accepted_license: '1' intvolume: ' 9' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: PLoS Genetics publication_status: published publisher: Public Library of Science publist_id: '4075' pubrep_id: '412' quality_controlled: '1' scopus_import: 1 status: public title: Environmental dependence of genetic constraint 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2013' ... --- _id: '2814' abstract: - lang: eng text: We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing "reset" action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies. We also discuss the memory requirement for deterministic strategies and extensions of our results to other models, such as pushdown systems and timed systems. 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: Alfaro, Luca last_name: Alfaro - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: Chatterjee K, Alfaro L, Majumdar R. The complexity of coverage. International Journal of Foundations of Computer Science. 2013;24(2):165-185. doi:10.1142/S0129054113400066 apa: Chatterjee, K., Alfaro, L., & Majumdar, R. (2013). The complexity of coverage. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054113400066 chicago: Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2013. https://doi.org/10.1142/S0129054113400066. ieee: K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013. ista: Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185. mla: Chatterjee, Krishnendu, et al. “The Complexity of Coverage.” International Journal of Foundations of Computer Science, vol. 24, no. 2, World Scientific Publishing, 2013, pp. 165–85, doi:10.1142/S0129054113400066. short: K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185. date_created: 2018-12-11T11:59:44Z date_published: 2013-02-01T00:00:00Z date_updated: 2021-01-12T06:59:54Z day: '01' department: - _id: KrCh doi: 10.1142/S0129054113400066 ec_funded: 1 external_id: arxiv: - '0804.4525' intvolume: ' 24' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/0804.4525 month: '02' oa: 1 oa_version: Preprint page: 165 - 185 project: - _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: International Journal of Foundations of Computer Science publication_status: published publisher: World Scientific Publishing publist_id: '4070' quality_controlled: '1' scopus_import: 1 status: public title: The complexity of coverage type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2013' ... --- _id: '2811' abstract: - lang: eng text: 'In pipe, channel, and boundary layer flows turbulence first occurs intermittently in space and time: at moderate Reynolds numbers domains of disordered turbulent motion are separated by quiescent laminar regions. Based on direct numerical simulations of pipe flow we argue here that the spatial intermittency has its origin in a nearest neighbor interaction between turbulent regions. We further show that in this regime turbulent flows are intrinsically intermittent with a well-defined equilibrium turbulent fraction but without ever assuming a steady pattern. This transition scenario is analogous to that found in simple models such as coupled map lattices. The scaling observed implies that laminar intermissions of the turbulent flow will persist to arbitrarily large Reynolds numbers.' article_number: '063012' author: - first_name: Marc full_name: Avila, Marc last_name: Avila - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Avila M, Hof B. Nature of laminar-turbulence intermittency in shear flows. Physical Review E. 2013;87(6). doi:10.1103/PhysRevE.87.063012 apa: Avila, M., & Hof, B. (2013). Nature of laminar-turbulence intermittency in shear flows. Physical Review E. American Institute of Physics. https://doi.org/10.1103/PhysRevE.87.063012 chicago: Avila, Marc, and Björn Hof. “Nature of Laminar-Turbulence Intermittency in Shear Flows.” Physical Review E. American Institute of Physics, 2013. https://doi.org/10.1103/PhysRevE.87.063012. ieee: M. Avila and B. Hof, “Nature of laminar-turbulence intermittency in shear flows,” Physical Review E, vol. 87, no. 6. American Institute of Physics, 2013. ista: Avila M, Hof B. 2013. Nature of laminar-turbulence intermittency in shear flows. Physical Review E. 87(6), 063012. mla: Avila, Marc, and Björn Hof. “Nature of Laminar-Turbulence Intermittency in Shear Flows.” Physical Review E, vol. 87, no. 6, 063012, American Institute of Physics, 2013, doi:10.1103/PhysRevE.87.063012. short: M. Avila, B. Hof, Physical Review E 87 (2013). date_created: 2018-12-11T11:59:43Z date_published: 2013-06-18T00:00:00Z date_updated: 2021-01-12T06:59:53Z day: '18' department: - _id: BjHo doi: 10.1103/PhysRevE.87.063012 ec_funded: 1 external_id: arxiv: - '1306.5890' intvolume: ' 87' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1306.5890 month: '06' oa: 1 oa_version: Preprint project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin publication: Physical Review E publication_status: published publisher: American Institute of Physics publist_id: '4074' quality_controlled: '1' scopus_import: 1 status: public title: Nature of laminar-turbulence intermittency in shear flows type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 87 year: '2013' ...