--- _id: '9932' abstract: - lang: eng text: Gene duplication is important in evolution, because it provides new raw material for evolutionary adaptations. Several existing hypotheses about the causes of duplicate retention and diversification differ in their emphasis on gene dosage, sub-functionalization, and neo-functionalization. Little experimental data exists on the relative importance of gene expression changes and changes in coding regions for the evolution of duplicate genes. Furthermore, we do not know how strongly the environment could affect this importance. To address these questions, we performed evolution experiments with the TEM-1 beta lactamase gene in E. coli to study the initial stages of duplicate gene evolution in the laboratory. We mimicked tandem duplication by inserting two copies of the TEM-1 gene on the same plasmid. We then subjected these copies to repeated cycles of mutagenesis and selection in various environments that contained antibiotics in different combinations and concentrations. Our experiments showed that gene dosage is the most important factor in the initial stages of duplicate gene evolution, and overshadows the importance of point mutations in the coding region. article_processing_charge: No author: - first_name: Riddhiman full_name: Dhar, Riddhiman last_name: Dhar - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Andreas full_name: Wagner, Andreas last_name: Wagner citation: ama: 'Dhar R, Bergmiller T, Wagner A. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. 2014. doi:10.5061/dryad.jc402' apa: 'Dhar, R., Bergmiller, T., & Wagner, A. (2014). Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. Dryad. https://doi.org/10.5061/dryad.jc402' chicago: 'Dhar, Riddhiman, Tobias Bergmiller, and Andreas Wagner. “Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” Dryad, 2014. https://doi.org/10.5061/dryad.jc402.' ieee: 'R. Dhar, T. Bergmiller, and A. Wagner, “Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes.” Dryad, 2014.' ista: 'Dhar R, Bergmiller T, Wagner A. 2014. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes, Dryad, 10.5061/dryad.jc402.' mla: 'Dhar, Riddhiman, et al. Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes. Dryad, 2014, doi:10.5061/dryad.jc402.' short: R. Dhar, T. Bergmiller, A. Wagner, (2014). date_created: 2021-08-17T09:11:40Z date_published: 2014-01-27T00:00:00Z date_updated: 2023-02-23T14:13:24Z day: '27' department: - _id: CaGu doi: 10.5061/dryad.jc402 main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.jc402 month: '01' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '9931' relation: used_in_publication status: public status: public title: 'Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2014' ... --- _id: '535' abstract: - lang: eng text: Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help. article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 2014;70(3):457-492. doi:10.1007/s00453-013-9843-7 apa: Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. https://doi.org/10.1007/s00453-013-9843-7 chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7. ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014. ista: Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492. mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:10.1007/s00453-013-9843-7. short: K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492. date_created: 2018-12-11T11:47:01Z date_published: 2014-11-01T00:00:00Z date_updated: 2023-09-05T14:09:29Z day: '01' department: - _id: KrCh doi: 10.1007/s00453-013-9843-7 ec_funded: 1 external_id: arxiv: - '1604.08234' intvolume: ' 70' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1604.08234 month: '11' oa: 1 oa_version: Preprint page: 457 - 492 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: Algorithmica publication_status: published publisher: Springer publist_id: '7282' quality_controlled: '1' related_material: record: - id: '10905' relation: earlier_version status: public scopus_import: '1' status: public title: Polynomial-time algorithms for energy games with special weight structures type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 70 year: '2014' ... --- _id: '10886' abstract: - lang: eng text: We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set. acknowledgement: This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP. alternative_title: - Mathematics and Visualization article_processing_charge: No author: - first_name: Valentin full_name: Zobel, Valentin last_name: Zobel - first_name: Jan full_name: Reininghaus, Jan id: 4505473A-F248-11E8-B48F-1D18A9856A87 last_name: Reininghaus - first_name: Ingrid full_name: Hotz, Ingrid last_name: Hotz citation: ama: 'Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: Topological Methods in Data Analysis and Visualization III . Springer; 2014:249-262. doi:10.1007/978-3-319-04099-8_16' apa: Zobel, V., Reininghaus, J., & Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In Topological Methods in Data Analysis and Visualization III (pp. 249–262). Springer. https://doi.org/10.1007/978-3-319-04099-8_16 chicago: Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In Topological Methods in Data Analysis and Visualization III , 249–62. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_16. ieee: V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in Topological Methods in Data Analysis and Visualization III , 2014, pp. 249–262. ista: Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262. mla: Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16. short: V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262. date_created: 2022-03-18T13:05:39Z date_published: 2014-03-19T00:00:00Z date_updated: 2023-09-05T14:13:16Z day: '19' department: - _id: HeEd doi: 10.1007/978-3-319-04099-8_16 language: - iso: eng month: '03' oa_version: None page: 249-262 publication: 'Topological Methods in Data Analysis and Visualization III ' publication_identifier: eisbn: - '9783319040998' eissn: - 2197-666X isbn: - '9783319040981' issn: - 1612-3786 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2014' ... --- _id: '6178' abstract: - lang: eng text: Mechanically coupled cells can generate forces driving cell and tissue morphogenesis during development. Visualization and measuring of these forces is of major importance to better understand the complexity of the biomechanic processes that shape cells and tissues. Here, we describe how UV laser ablation can be utilized to quantitatively assess mechanical tension in different tissues of the developing zebrafish and in cultures of primary germ layer progenitor cells ex vivo. article_processing_charge: No author: - first_name: Michael full_name: Smutny, Michael id: 3FE6E4E8-F248-11E8-B48F-1D18A9856A87 last_name: Smutny orcid: 0000-0002-5920-9090 - first_name: Martin full_name: Behrndt, Martin id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87 last_name: Behrndt - first_name: Pedro full_name: Campinho, Pedro id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87 last_name: Campinho orcid: 0000-0002-8526-5416 - first_name: Verena full_name: Ruprecht, Verena id: 4D71A03A-F248-11E8-B48F-1D18A9856A87 last_name: Ruprecht orcid: 0000-0003-4088-8633 - 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: 'Smutny M, Behrndt M, Campinho P, Ruprecht V, Heisenberg C-PJ. UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In: Nelson C, ed. Tissue Morphogenesis. Vol 1189. Methods in Molecular Biology. New York, NY: Springer; 2014:219-235. doi:10.1007/978-1-4939-1164-6_15' apa: 'Smutny, M., Behrndt, M., Campinho, P., Ruprecht, V., & Heisenberg, C.-P. J. (2014). UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In C. Nelson (Ed.), Tissue Morphogenesis (Vol. 1189, pp. 219–235). New York, NY: Springer. https://doi.org/10.1007/978-1-4939-1164-6_15' chicago: 'Smutny, Michael, Martin Behrndt, Pedro Campinho, Verena Ruprecht, and Carl-Philipp J Heisenberg. “UV Laser Ablation to Measure Cell and Tissue-Generated Forces in the Zebrafish Embryo in Vivo and Ex Vivo.” In Tissue Morphogenesis, edited by Celeste Nelson, 1189:219–35. Methods in Molecular Biology. New York, NY: Springer, 2014. https://doi.org/10.1007/978-1-4939-1164-6_15.' ieee: 'M. Smutny, M. Behrndt, P. Campinho, V. Ruprecht, and C.-P. J. Heisenberg, “UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo,” in Tissue Morphogenesis, vol. 1189, C. Nelson, Ed. New York, NY: Springer, 2014, pp. 219–235.' ista: 'Smutny M, Behrndt M, Campinho P, Ruprecht V, Heisenberg C-PJ. 2014.UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In: Tissue Morphogenesis. vol. 1189, 219–235.' mla: Smutny, Michael, et al. “UV Laser Ablation to Measure Cell and Tissue-Generated Forces in the Zebrafish Embryo in Vivo and Ex Vivo.” Tissue Morphogenesis, edited by Celeste Nelson, vol. 1189, Springer, 2014, pp. 219–35, doi:10.1007/978-1-4939-1164-6_15. short: M. Smutny, M. Behrndt, P. Campinho, V. Ruprecht, C.-P.J. Heisenberg, in:, C. Nelson (Ed.), Tissue Morphogenesis, Springer, New York, NY, 2014, pp. 219–235. date_created: 2019-03-26T08:55:59Z date_published: 2014-08-22T00:00:00Z date_updated: 2023-09-05T14:12:00Z day: '22' department: - _id: CaHe doi: 10.1007/978-1-4939-1164-6_15 editor: - first_name: Celeste full_name: Nelson, Celeste last_name: Nelson external_id: pmid: - '25245697' intvolume: ' 1189' language: - iso: eng month: '08' oa_version: None page: 219-235 place: New York, NY pmid: 1 publication: Tissue Morphogenesis publication_identifier: eissn: - 1940-6029 isbn: - '9781493911639' - '9781493911646' issn: - 1064-3745 publication_status: published publisher: Springer quality_controlled: '1' series_title: Methods in Molecular Biology status: public title: UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo type: book_chapter user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 1189 year: '2014' ... --- _id: '10814' abstract: - lang: eng text: We review recent progress towards a rigorous understanding of the excitation spectrum of bosonic quantum many-body systems. In particular, we explain how one can rigorously establish the predictions resulting from the Bogoliubov approximation in the mean field limit. The latter predicts that the spectrum is made up of elementary excitations, whose energy behaves linearly in the momentum for small momentum. This property is crucial for the superfluid behavior of the system. We also discuss a list of open problems in this field. article_processing_charge: No article_type: original 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. The excitation spectrum for Bose fluids with weak interactions. Jahresbericht der Deutschen Mathematiker-Vereinigung. 2014;116:21-41. doi:10.1365/s13291-014-0083-9 apa: Seiringer, R. (2014). The excitation spectrum for Bose fluids with weak interactions. Jahresbericht Der Deutschen Mathematiker-Vereinigung. Springer Nature. https://doi.org/10.1365/s13291-014-0083-9 chicago: Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.” Jahresbericht Der Deutschen Mathematiker-Vereinigung. Springer Nature, 2014. https://doi.org/10.1365/s13291-014-0083-9. ieee: R. Seiringer, “The excitation spectrum for Bose fluids with weak interactions,” Jahresbericht der Deutschen Mathematiker-Vereinigung, vol. 116. Springer Nature, pp. 21–41, 2014. ista: Seiringer R. 2014. The excitation spectrum for Bose fluids with weak interactions. Jahresbericht der Deutschen Mathematiker-Vereinigung. 116, 21–41. mla: Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.” Jahresbericht Der Deutschen Mathematiker-Vereinigung, vol. 116, Springer Nature, 2014, pp. 21–41, doi:10.1365/s13291-014-0083-9. short: R. Seiringer, Jahresbericht Der Deutschen Mathematiker-Vereinigung 116 (2014) 21–41. date_created: 2022-03-04T07:54:39Z date_published: 2014-03-01T00:00:00Z date_updated: 2023-09-05T14:19:47Z day: '01' department: - _id: RoSe doi: 10.1365/s13291-014-0083-9 intvolume: ' 116' keyword: - General Medicine language: - iso: eng month: '03' oa_version: None page: 21-41 publication: Jahresbericht der Deutschen Mathematiker-Vereinigung publication_identifier: eissn: - 1869-7135 issn: - 0012-0456 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: The excitation spectrum for Bose fluids with weak interactions type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 116 year: '2014' ... --- _id: '10817' abstract: - lang: eng text: The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption. acknowledgement: This research is supported and funded by the Digiteo unTopoVis project, the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC. article_processing_charge: No author: - first_name: David full_name: Günther, David last_name: Günther - first_name: Jan full_name: Reininghaus, Jan id: 4505473A-F248-11E8-B48F-1D18A9856A87 last_name: Reininghaus - first_name: Hans-Peter full_name: Seidel, Hans-Peter last_name: Seidel - first_name: Tino full_name: Weinkauf, Tino last_name: Weinkauf citation: ama: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III. Mathematics and Visualization. Cham: Springer Nature; 2014:135-150. doi:10.1007/978-3-319-04099-8_9' apa: 'Günther, D., Reininghaus, J., Seidel, H.-P., & Weinkauf, T. (2014). Notes on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III. (pp. 135–150). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-04099-8_9' chicago: 'Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf. “Notes on the Simplification of the Morse-Smale Complex.” In Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-04099-8_9.' ieee: 'D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the simplification of the Morse-Smale complex,” in Topological Methods in Data Analysis and Visualization III., P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.' ista: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization III. , 135–150.' mla: Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.” Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:10.1007/978-3-319-04099-8_9. short: D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III., Springer Nature, Cham, 2014, pp. 135–150. date_created: 2022-03-04T08:33:57Z date_published: 2014-03-19T00:00:00Z date_updated: 2023-09-05T15:33:45Z day: '19' department: - _id: HeEd doi: 10.1007/978-3-319-04099-8_9 ec_funded: 1 editor: - first_name: Peer-Timo full_name: Bremer, Peer-Timo last_name: Bremer - first_name: Ingrid full_name: Hotz, Ingrid last_name: Hotz - first_name: Valerio full_name: Pascucci, Valerio last_name: Pascucci - first_name: Ronald full_name: Peikert, Ronald last_name: Peikert language: - iso: eng month: '03' oa_version: None page: 135-150 place: Cham project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Topological Methods in Data Analysis and Visualization III. publication_identifier: eisbn: - '9783319040998' eissn: - 2197-666X isbn: - '9783319040981' issn: - 1612-3786 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: Mathematics and Visualization status: public title: Notes on the simplification of the Morse-Smale complex type: book_chapter user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2014' ... --- _id: '1395' abstract: - lang: eng text: In this thesis I studied various individual and social immune defences employed by the invasive garden ant Lasius neglectus mostly against entomopathogenic fungi. The first two chapters of this thesis address the phenomenon of 'social immunisation'. Social immunisation, that is the immunological protection of group members due to social contact to a pathogen-exposed nestmate, has been described in various social insect species against different types of pathogens. However, in the case of entomopathogenic fungi it has, so far, only been demonstrated that social immunisation exists at all. Its underlying mechanisms r any other properties were, however, unknown. In the first chapter of this thesis I identified the mechanistic basis of social immunisation in L. neglectus against the entomopathogenous fungus Metarhizium. I could show that nestmates of a pathogen-exposed individual contract low-level infections due to social interactions. These low-level infections are, however, non-lethal and cause an active stimulation of the immune system, which protects the nestmates upon subsequent pathogen encounters. In the second chapter of this thesis I investigated the specificity and colony level effects of social immunisation. I demonstrated that the protection conferred by social immunisation is highly specific, protecting ants only against the same pathogen strain. In addition, depending on the respective context, social immunisation may even cause fitness costs. I further showed that social immunisation crucially affects sanitary behaviour and disease dynamics within ant groups. In the third chapter of this thesis I studied the effects of the ectosymbiotic fungus Laboulbenia formicarum on its host L. neglectus. Although Laboulbeniales are the largest order of insect-parasitic fungi, research concerning host fitness consequence is sparse. I showed that highly Laboulbenia-infected ants sustain fitness costs under resource limitation, however, gain fitness benefits when exposed to an entomopathogenus fungus. These effects are probably cause by a prophylactic upregulation of behavioural as well as physiological immune defences in highly infected ants. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Matthias full_name: Konrad, Matthias id: 46528076-F248-11E8-B48F-1D18A9856A87 last_name: Konrad citation: ama: 'Konrad M. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. 2014.' apa: 'Konrad, M. (2014). Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology Austria.' chicago: 'Konrad, Matthias. “Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus.” Institute of Science and Technology Austria, 2014.' ieee: 'M. Konrad, “Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus,” Institute of Science and Technology Austria, 2014.' ista: 'Konrad M. 2014. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology Austria.' mla: 'Konrad, Matthias. Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus. Institute of Science and Technology Austria, 2014.' short: 'M. Konrad, Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus, Institute of Science and Technology Austria, 2014.' date_created: 2018-12-11T11:51:46Z date_published: 2014-02-01T00:00:00Z date_updated: 2023-09-07T11:38:56Z day: '01' degree_awarded: PhD department: - _id: SyCr language: - iso: eng month: '02' oa_version: None page: '131' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '5814' status: public supervisor: - first_name: Sylvia M full_name: Cremer, Sylvia M id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 title: 'Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus' type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2014' ... --- _id: '1402' abstract: - lang: eng text: Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated into various lipid signaling molecules, designated polyphosphoinositides (PPIs). The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol is performed by a set of organelle-specific kinases and phosphatases, and the characteristic head groups make these molecules ideal for regulating biological processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2 play crucial roles in trafficking toward the lytic compartments, whereas the role in plants is not yet fully understood. Here we identified the role of a land plant-specific subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize to the tonoplast along with Ptdlns3P, the presumable product of their activity. in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates and bisphosphates were changed, with opposite effects on the morphology of storage and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover, multiple sac knockout mutants had an increased number of smaller storage and lytic vacuoles, whereas extralarge vacuoles were observed in the overexpression lines, correlating with various growth and developmental defects. The fragmented vacuolar phenotype of sac mutants could be mimicked by treating wild-type seedlings with Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology. Taken together, these results provide evidence that PPIs, together with their metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar morphology and function in plants. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Petra full_name: Marhavá, Petra id: 44E59624-F248-11E8-B48F-1D18A9856A87 last_name: Marhavá citation: ama: Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. 2014. apa: Marhavá, P. (2014). Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria. chicago: Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014. ieee: P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014. ista: Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria. mla: Marhavá, Petra. Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana. Institute of Science and Technology Austria, 2014. short: P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014. date_created: 2018-12-11T11:51:49Z date_published: 2014-12-01T00:00:00Z date_updated: 2023-09-07T11:39:38Z day: '01' degree_awarded: PhD department: - _id: JiFr language: - iso: eng month: '12' oa_version: None page: '90' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '5805' status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2014' ... --- _id: '2255' abstract: - lang: eng text: Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm. author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Florian full_name: Pausinger, Florian id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87 last_name: Pausinger orcid: 0000-0002-8379-3768 citation: ama: Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 2014;50(1):164-177. doi:10.1007/s10851-013-0468-x apa: Edelsbrunner, H., & Pausinger, F. (2014). Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. Springer. https://doi.org/10.1007/s10851-013-0468-x chicago: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision. Springer, 2014. https://doi.org/10.1007/s10851-013-0468-x. ieee: H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp. 164–177, 2014. ista: Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177. mla: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x. short: H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177. date_created: 2018-12-11T11:56:36Z date_published: 2014-09-01T00:00:00Z date_updated: 2023-09-07T11:41:25Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s10851-013-0468-x ec_funded: 1 file: - access_level: open_access checksum: 2f93f3e63a38a85cd4404d7953913b14 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:18Z date_updated: 2020-07-14T12:45:35Z file_id: '5204' file_name: IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf file_size: 3941391 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 50' issue: '1' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 164 - 177 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Journal of Mathematical Imaging and Vision publication_identifier: issn: - '09249907' publication_status: published publisher: Springer publist_id: '4691' pubrep_id: '549' quality_controlled: '1' related_material: record: - id: '2843' relation: earlier_version status: public - id: '1399' relation: dissertation_contains status: public scopus_import: 1 status: public title: Stable length estimates of tube-like shapes type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 50 year: '2014' ... --- _id: '2159' abstract: - lang: eng text: 'Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) selfintersection points of maps from finite simplicial complexes (compact polyhedra) into ℝd and study conditions under which such multiple points can be eliminated. The most classical case is that of embeddings (i.e., maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem, the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary condition for embeddability (namely, vanishing of the van Kampen ob-struction). For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes then one can successively remove these double points by local modifications of the map f. One of the main tools is the famous Whitney trick that permits eliminating pairs of double points of opposite intersection sign. We are interested in generalizing this approach to intersection points of higher multiplicity. We call a point y 2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e., does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time algorithm for deciding this (based on the vanishing of a cohomological obstruction, as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney trick: Given r pairwise disjoint simplices of K such that the intersection of their images contains two r-fold Tverberg points y+ and y- of opposite intersection sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper, we plan to develop this further and present a generalization of the classical Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability of κ-complexes into ℝd for a wider range of dimensions) to intersection points of higher multiplicity.' acknowledgement: Swiss National Science Foundation (Project SNSF-PP00P2-138948) author: - first_name: Isaac full_name: Mabillard, Isaac id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87 last_name: Mabillard - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:171-180. doi:10.1145/2582112.2582134' apa: 'Mabillard, I., & Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In Proceedings of the Annual Symposium on Computational Geometry (pp. 171–180). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582134' chicago: Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In Proceedings of the Annual Symposium on Computational Geometry, 171–80. ACM, 2014. https://doi.org/10.1145/2582112.2582134. ieee: I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 171–180. ista: 'Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.' mla: Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–80, doi:10.1145/2582112.2582134. short: I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180. conference: end_date: 2014-06-11 location: Kyoto, Japan name: 'SoCG: Symposium on Computational Geometry' start_date: 2014-06-08 date_created: 2018-12-11T11:56:03Z date_published: 2014-06-08T00:00:00Z date_updated: 2023-09-07T11:56:27Z day: '08' ddc: - '510' department: - _id: UlWa doi: 10.1145/2582112.2582134 file: - access_level: open_access checksum: 2aae223fee8ffeaf57bbabd8d92b6a2c content_type: application/pdf creator: system date_created: 2018-12-12T10:09:12Z date_updated: 2020-07-14T12:45:30Z file_id: '4735' file_name: IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf file_size: 914396 relation: main_file file_date_updated: 2020-07-14T12:45:30Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 171 - 180 publication: Proceedings of the Annual Symposium on Computational Geometry publication_status: published publisher: ACM publist_id: '4847' pubrep_id: '534' quality_controlled: '1' related_material: record: - id: '1123' relation: dissertation_contains status: public scopus_import: 1 status: public title: Eliminating Tverberg points, I. An analogue of the Whitney trick type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2023' abstract: - lang: eng text: 'Understanding the evolution of dispersal is essential for understanding and predicting the dynamics of natural populations. Two main factors are known to influence dispersal evolution: spatio-temporal variation in the environment and relatedness between individuals. However, the relation between these factors is still poorly understood, and they are usually treated separately. In this article, I present a theoretical framework that contains and connects effects of both environmental variation and relatedness, and reproduces and extends their known features. Spatial habitat variation selects for balanced dispersal strategies, whereby the population is kept at an ideal free distribution. Within this class of dispersal strategies, I explain how increased dispersal is promoted by perturbations to the dispersal type frequencies. An explicit formula shows the magnitude of the selective advantage of increased dispersal in terms of the spatial variability in the frequencies of the different dispersal strategies present. These variances are capable of capturing various sources of stochasticity and hence establish a common scale for their effects on the evolution of dispersal. The results furthermore indicate an alternative approach to identifying effects of relatedness on dispersal evolution.' author: - first_name: Sebastian full_name: Novak, Sebastian id: 461468AE-F248-11E8-B48F-1D18A9856A87 last_name: Novak orcid: 0000-0002-2519-824X citation: ama: Novak S. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. Ecology and Evolution. 2014;4(24):4589-4597. doi:10.1002/ece3.1289 apa: Novak, S. (2014). Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1289 chicago: Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” Ecology and Evolution. Wiley-Blackwell, 2014. https://doi.org/10.1002/ece3.1289. ieee: S. Novak, “Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution,” Ecology and Evolution, vol. 4, no. 24. Wiley-Blackwell, pp. 4589–4597, 2014. ista: Novak S. 2014. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. Ecology and Evolution. 4(24), 4589–4597. mla: Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” Ecology and Evolution, vol. 4, no. 24, Wiley-Blackwell, 2014, pp. 4589–97, doi:10.1002/ece3.1289. short: S. Novak, Ecology and Evolution 4 (2014) 4589–4597. date_created: 2018-12-11T11:55:16Z date_published: 2014-11-27T00:00:00Z date_updated: 2023-09-07T11:55:53Z day: '27' ddc: - '570' department: - _id: NiBa doi: 10.1002/ece3.1289 ec_funded: 1 file: - access_level: open_access checksum: 9ab43db1b0fede7bfe560ed77e177b76 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:28Z date_updated: 2020-07-14T12:45:25Z file_id: '4946' file_name: IST-2016-462-v1+1_Novak-2014-Ecology_and_Evolution.pdf file_size: 118813 relation: main_file file_date_updated: 2020-07-14T12:45:25Z has_accepted_license: '1' intvolume: ' 4' issue: '24' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '11' oa: 1 oa_version: Published Version page: 4589 - 4597 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Ecology and Evolution publication_status: published publisher: Wiley-Blackwell publist_id: '5049' pubrep_id: '462' quality_controlled: '1' related_material: record: - id: '1125' relation: dissertation_contains status: public scopus_import: 1 status: public title: Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal 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: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2014' ... --- _id: '2218' abstract: - lang: eng text: While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs. alternative_title: - LNCS author: - first_name: Pavol full_name: Cerny, Pavol 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 - first_name: Leonid full_name: Ryzhyk, Leonid last_name: Ryzhyk - first_name: Thorsten full_name: Tarrach, Thorsten id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87 last_name: Tarrach orcid: 0000-0003-4409-8487 citation: ama: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:10.1007/978-3-319-08867-9_38' apa: 'Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_38' chicago: Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_38. ieee: 'P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.' ista: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584.' mla: Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol. 8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38. short: P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584. conference: end_date: 2014-07-22 location: Vienna, Austria name: 'CAV: Computer Aided Verification' start_date: 2014-07-18 date_created: 2018-12-11T11:56:23Z date_published: 2014-07-22T00:00:00Z date_updated: 2023-09-07T11:57:01Z day: '22' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-319-08867-9_38 ec_funded: 1 file: - access_level: open_access checksum: a631d3105509f239724644e77a1212e2 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:14Z date_updated: 2020-07-14T12:45:33Z file_id: '4995' file_name: IST-2014-297-v1+1_cav14-final.pdf file_size: 416732 relation: main_file - access_level: open_access checksum: f8b0f748cc9fa697ca992cc56c87bc4e content_type: application/pdf creator: system date_created: 2018-12-12T10:13:15Z date_updated: 2020-07-14T12:45:33Z file_id: '4996' file_name: IST-2014-297-v2+1_cav14-final2.pdf file_size: 616293 relation: main_file file_date_updated: 2020-07-14T12:45:33Z has_accepted_license: '1' intvolume: ' 8559' language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38 month: '07' oa: 1 oa_version: Submitted Version page: 568 - 584 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_identifier: isbn: - 978-331908866-2 publication_status: published publisher: Springer publist_id: '4749' pubrep_id: '297' quality_controlled: '1' related_material: record: - id: '1130' relation: dissertation_contains status: public status: public title: Regression-free synthesis for concurrency type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8559 year: '2014' ... --- _id: '2167' abstract: - lang: eng text: Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing. In this paper, we study compositional properties of the ioco-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the ioco conformance relation, the resulting methodology can be applied to a broader class of systems. article_number: '6823899' article_processing_charge: No author: - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - 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: Willibald full_name: Krenn, Willibald last_name: Krenn - first_name: Dejan full_name: Nickovic, Dejan last_name: Nickovic citation: ama: 'Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional specifications for IOCO testing. In: IEEE 7th International Conference on Software Testing, Verification and Validation. IEEE; 2014. doi:10.1109/ICST.2014.50' apa: 'Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional specifications for IOCO testing. In IEEE 7th International Conference on Software Testing, Verification and Validation. Cleveland, USA: IEEE. https://doi.org/10.1109/ICST.2014.50' chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. “Compositional Specifications for IOCO Testing.” In IEEE 7th International Conference on Software Testing, Verification and Validation. IEEE, 2014. https://doi.org/10.1109/ICST.2014.50. ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, “Compositional specifications for IOCO testing,” in IEEE 7th International Conference on Software Testing, Verification and Validation, Cleveland, USA, 2014. ista: 'Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing. IEEE 7th International Conference on Software Testing, Verification and Validation. ICST: International Conference on Software Testing, Verification and Validation, 6823899.' mla: Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.” IEEE 7th International Conference on Software Testing, Verification and Validation, 6823899, IEEE, 2014, doi:10.1109/ICST.2014.50. short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International Conference on Software Testing, Verification and Validation, IEEE, 2014. conference: end_date: 2014-04-04 location: Cleveland, USA name: 'ICST: International Conference on Software Testing, Verification and Validation' start_date: 2014-03-31 date_created: 2018-12-11T11:56:06Z date_published: 2014-03-01T00:00:00Z date_updated: 2023-09-07T11:58:33Z day: '01' department: - _id: ToHe doi: 10.1109/ICST.2014.50 ec_funded: 1 external_id: arxiv: - '1904.07083' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.07083 month: '03' oa: 1 oa_version: Preprint 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: IEEE 7th International Conference on Software Testing, Verification and Validation publication_identifier: isbn: - 978-1-4799-2255-0 issn: - 2159-4848 publication_status: published publisher: IEEE publist_id: '4817' quality_controlled: '1' related_material: record: - id: '5411' relation: earlier_version status: public - id: '1155' relation: dissertation_contains status: public scopus_import: 1 status: public title: Compositional specifications for IOCO testing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2063' abstract: - lang: eng text: We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis 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: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca citation: ama: 'Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:10.1007/978-3-319-08867-9_31' apa: 'Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31' chicago: Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31. ieee: 'K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.' ista: 'Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.' mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31. short: K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490. conference: end_date: 2014-07-22 location: Vienna, Austria name: 'CAV: Computer Aided Verification' start_date: 2014-07-18 date_created: 2018-12-11T11:55:30Z date_published: 2014-07-01T00:00:00Z date_updated: 2023-09-07T11:58:33Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-08867-9_31 ec_funded: 1 intvolume: ' 8559' language: - iso: eng month: '07' oa_version: None page: 473 - 490 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: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _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 - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '4978' quality_controlled: '1' related_material: record: - id: '5412' relation: earlier_version status: public - id: '5413' relation: earlier_version status: public - id: '5414' relation: earlier_version status: public - id: '1155' relation: dissertation_contains status: public status: public title: CEGAR for qualitative analysis of probabilistic systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8559 year: '2014' ... --- _id: '2001' abstract: - lang: eng text: Antibiotics affect bacterial cell physiology at many levels. Rather than just compensating for the direct cellular defects caused by the drug, bacteria respond to antibiotics by changing their morphology, macromolecular composition, metabolism, gene expression and possibly even their mutation rate. Inevitably, these processes affect each other, resulting in a complex response with changes in the expression of numerous genes. Genome‐wide approaches can thus help in gaining a comprehensive understanding of bacterial responses to antibiotics. In addition, a combination of experimental and theoretical approaches is needed for identifying general principles that underlie these responses. Here, we review recent progress in our understanding of bacterial responses to antibiotics and their combinations, focusing on effects at the levels of growth rate and gene expression. We concentrate on studies performed in controlled laboratory conditions, which combine promising experimental techniques with quantitative data analysis and mathematical modeling. While these basic research approaches are not immediately applicable in the clinic, uncovering the principles and mechanisms underlying bacterial responses to antibiotics may, in the long term, contribute to the development of new treatment strategies to cope with and prevent the rise of resistant pathogenic bacteria. author: - first_name: Karin full_name: Mitosch, Karin id: 39B66846-F248-11E8-B48F-1D18A9856A87 last_name: Mitosch - first_name: Tobias full_name: Bollenbach, Tobias id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87 last_name: Bollenbach orcid: 0000-0003-4398-476X citation: ama: Mitosch K, Bollenbach MT. Bacterial responses to antibiotics and their combinations. Environmental Microbiology Reports. 2014;6(6):545-557. doi:10.1111/1758-2229.12190 apa: Mitosch, K., & Bollenbach, M. T. (2014). Bacterial responses to antibiotics and their combinations. Environmental Microbiology Reports. Wiley. https://doi.org/10.1111/1758-2229.12190 chicago: Mitosch, Karin, and Mark Tobias Bollenbach. “Bacterial Responses to Antibiotics and Their Combinations.” Environmental Microbiology Reports. Wiley, 2014. https://doi.org/10.1111/1758-2229.12190. ieee: K. Mitosch and M. T. Bollenbach, “Bacterial responses to antibiotics and their combinations,” Environmental Microbiology Reports, vol. 6, no. 6. Wiley, pp. 545–557, 2014. ista: Mitosch K, Bollenbach MT. 2014. Bacterial responses to antibiotics and their combinations. Environmental Microbiology Reports. 6(6), 545–557. mla: Mitosch, Karin, and Mark Tobias Bollenbach. “Bacterial Responses to Antibiotics and Their Combinations.” Environmental Microbiology Reports, vol. 6, no. 6, Wiley, 2014, pp. 545–57, doi:10.1111/1758-2229.12190. short: K. Mitosch, M.T. Bollenbach, Environmental Microbiology Reports 6 (2014) 545–557. date_created: 2018-12-11T11:55:08Z date_published: 2014-06-22T00:00:00Z date_updated: 2023-09-07T12:00:25Z day: '22' department: - _id: ToBo doi: 10.1111/1758-2229.12190 ec_funded: 1 intvolume: ' 6' issue: '6' language: - iso: eng month: '06' oa_version: None page: 545 - 557 project: - _id: 25EB3A80-B435-11E9-9278-68D0E5697425 grant_number: RGP0042/2013 name: Revealing the fundamental limits of cell growth - _id: 25E83C2C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '303507' name: Optimality principles in responses to antibiotics publication: Environmental Microbiology Reports publication_status: published publisher: Wiley publist_id: '5076' quality_controlled: '1' related_material: record: - id: '818' relation: dissertation_contains status: public scopus_import: 1 status: public title: Bacterial responses to antibiotics and their combinations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2014' ... --- _id: '2082' abstract: - lang: eng text: 'NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto''96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto''06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto''99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto''05].' alternative_title: - LNCS author: - first_name: Peter full_name: Gazi, Peter id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87 last_name: Gazi - 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: Michal full_name: Rybar, Michal id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87 last_name: Rybar citation: ama: 'Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:10.1007/978-3-662-44371-2_7' apa: 'Gazi, P., Pietrzak, K. Z., & Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay & R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. https://doi.org/10.1007/978-3-662-44371-2_7' chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. https://doi.org/10.1007/978-3-662-44371-2_7. ieee: 'P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.' ista: 'Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.' mla: Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7. short: P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130. conference: end_date: 2014-08-21 location: Santa Barbara, USA name: 'CRYPTO: International Cryptology Conference' start_date: 2014-08-17 date_created: 2018-12-11T11:55:36Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-09-07T12:02:27Z day: '01' ddc: - '000' - '004' department: - _id: KrPi doi: 10.1007/978-3-662-44371-2_7 ec_funded: 1 editor: - first_name: Juan full_name: Garay, Juan last_name: Garay - first_name: Rosario full_name: Gennaro, Rosario last_name: Gennaro file: - access_level: open_access checksum: dab6ab36a5f6af94f2b597e6404ed11d content_type: application/pdf creator: system date_created: 2018-12-12T10:13:17Z date_updated: 2020-07-14T12:45:28Z file_id: '4999' file_name: IST-2016-682-v1+1_578.pdf file_size: 492310 relation: main_file file_date_updated: 2020-07-14T12:45:28Z has_accepted_license: '1' intvolume: ' 8616' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 113 - 130 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: '4955' pubrep_id: '682' quality_controlled: '1' related_material: record: - id: '838' relation: dissertation_contains status: public status: public title: The exact PRF-security of NMAC and HMAC type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 8616 year: '2014' ... --- _id: '1912' abstract: - lang: eng text: Kupffer's vesicle (KV) is the zebrafish organ of laterality, patterning the embryo along its left-right (LR) axis. Regional differences in cell shape within the lumen-lining KV epithelium are essential for its LR patterning function. However, the processes by which KV cells acquire their characteristic shapes are largely unknown. Here, we show that the notochord induces regional differences in cell shape within KV by triggering extracellular matrix (ECM) accumulation adjacent to anterior-dorsal (AD) regions of KV. This localized ECM deposition restricts apical expansion of lumen-lining epithelial cells in AD regions of KV during lumen growth. Our study provides mechanistic insight into the processes by which KV translates global embryonic patterning into regional cell shape differences required for its LR symmetry-breaking function. acknowledgement: We are grateful to members of the C.-P.H. lab, M. Concha, D. Siekhaus, and J. Vermot for comments on the manuscript and to M. Furutani-Seiki for sharing reagents. This work was supported by the Institute of Science and Technology Austria and an Alexander von Humboldt Foundation fellowship to J.C. article_processing_charge: No author: - first_name: Julien full_name: Compagnon, Julien id: 2E3E0988-F248-11E8-B48F-1D18A9856A87 last_name: Compagnon - first_name: Vanessa full_name: Barone, Vanessa id: 419EECCC-F248-11E8-B48F-1D18A9856A87 last_name: Barone orcid: 0000-0003-2676-3367 - first_name: Srivarsha full_name: Rajshekar, Srivarsha last_name: Rajshekar - first_name: Rita full_name: Kottmeier, Rita last_name: Kottmeier - first_name: Kornelija full_name: Pranjic-Ferscha, Kornelija id: 4362B3C2-F248-11E8-B48F-1D18A9856A87 last_name: Pranjic-Ferscha - first_name: Martin full_name: Behrndt, Martin id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87 last_name: Behrndt - 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: Compagnon J, Barone V, Rajshekar S, et al. The notochord breaks bilateral symmetry by controlling cell shapes in the Zebrafish laterality organ. Developmental Cell. 2014;31(6):774-783. doi:10.1016/j.devcel.2014.11.003 apa: Compagnon, J., Barone, V., Rajshekar, S., Kottmeier, R., Pranjic-Ferscha, K., Behrndt, M., & Heisenberg, C.-P. J. (2014). The notochord breaks bilateral symmetry by controlling cell shapes in the Zebrafish laterality organ. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2014.11.003 chicago: Compagnon, Julien, Vanessa Barone, Srivarsha Rajshekar, Rita Kottmeier, Kornelija Pranjic-Ferscha, Martin Behrndt, and Carl-Philipp J Heisenberg. “The Notochord Breaks Bilateral Symmetry by Controlling Cell Shapes in the Zebrafish Laterality Organ.” Developmental Cell. Cell Press, 2014. https://doi.org/10.1016/j.devcel.2014.11.003. ieee: J. Compagnon et al., “The notochord breaks bilateral symmetry by controlling cell shapes in the Zebrafish laterality organ,” Developmental Cell, vol. 31, no. 6. Cell Press, pp. 774–783, 2014. ista: Compagnon J, Barone V, Rajshekar S, Kottmeier R, Pranjic-Ferscha K, Behrndt M, Heisenberg C-PJ. 2014. The notochord breaks bilateral symmetry by controlling cell shapes in the Zebrafish laterality organ. Developmental Cell. 31(6), 774–783. mla: Compagnon, Julien, et al. “The Notochord Breaks Bilateral Symmetry by Controlling Cell Shapes in the Zebrafish Laterality Organ.” Developmental Cell, vol. 31, no. 6, Cell Press, 2014, pp. 774–83, doi:10.1016/j.devcel.2014.11.003. short: J. Compagnon, V. Barone, S. Rajshekar, R. Kottmeier, K. Pranjic-Ferscha, M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 31 (2014) 774–783. date_created: 2018-12-11T11:54:41Z date_published: 2014-12-22T00:00:00Z date_updated: 2023-09-07T12:05:08Z day: '22' department: - _id: CaHe doi: 10.1016/j.devcel.2014.11.003 external_id: pmid: - '25535919' intvolume: ' 31' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pubmed/25535919 month: '12' oa: 1 oa_version: Published Version page: 774 - 783 pmid: 1 publication: Developmental Cell publication_status: published publisher: Cell Press publist_id: '5182' quality_controlled: '1' related_material: record: - id: '961' relation: dissertation_contains status: public scopus_import: '1' status: public title: The notochord breaks bilateral symmetry by controlling cell shapes in the Zebrafish laterality organ type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2014' ... --- _id: '2084' abstract: - lang: eng text: Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour. acknowledgement: European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech author: - first_name: Michael full_name: Grusch, Michael last_name: Grusch - first_name: Karin full_name: Schelch, Karin last_name: Schelch - first_name: Robert full_name: Riedler, Robert last_name: Riedler - first_name: Eva full_name: Gschaider-Reichhart, Eva id: 3FEE232A-F248-11E8-B48F-1D18A9856A87 last_name: Gschaider-Reichhart orcid: 0000-0002-7218-7738 - first_name: Christopher full_name: Differ, Christopher last_name: Differ - first_name: Walter full_name: Berger, Walter last_name: Berger - first_name: Álvaro full_name: Inglés Prieto, Álvaro id: 2A9DB292-F248-11E8-B48F-1D18A9856A87 last_name: Inglés Prieto orcid: 0000-0002-5409-8571 - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 citation: ama: Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 2014;33(15):1713-1726. doi:10.15252/embj.201387695 apa: Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. Wiley-Blackwell. https://doi.org/10.15252/embj.201387695 chicago: Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” EMBO Journal. Wiley-Blackwell, 2014. https://doi.org/10.15252/embj.201387695. ieee: M. Grusch et al., “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” EMBO Journal, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014. ista: Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726. mla: Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” EMBO Journal, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:10.15252/embj.201387695. short: M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726. date_created: 2018-12-11T11:55:37Z date_published: 2014-07-01T00:00:00Z date_updated: 2023-09-07T12:49:09Z day: '01' department: - _id: HaJa doi: 10.15252/embj.201387695 intvolume: ' 33' issue: '15' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/ month: '07' oa: 1 oa_version: Submitted Version page: 1713 - 1726 publication: EMBO Journal publication_status: published publisher: Wiley-Blackwell publist_id: '4953' quality_controlled: '1' related_material: record: - id: '418' relation: dissertation_contains status: public scopus_import: 1 status: public title: Spatio-temporally precise activation of engineered receptor tyrosine kinases by light type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2014' ... --- _id: '2157' abstract: - lang: eng text: 'We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X.' acknowledgement: ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023 (SNSF-PP00P2-138948); Swiss National Science Foundation (SNSF-200020-138230). 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. Embeddability in the 3 sphere is decidable. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:78-84. doi:10.1145/2582112.2582137' apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational Geometry (pp. 78–84). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582137' chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In Proceedings of the Annual Symposium on Computational Geometry, 78–84. ACM, 2014. https://doi.org/10.1145/2582112.2582137. ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 78–84. ista: 'Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.' mla: Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84, doi:10.1145/2582112.2582137. short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84. conference: end_date: 2014-06-11 location: Kyoto, Japan name: 'SoCG: Symposium on Computational Geometry' start_date: 2014-06-08 date_created: 2018-12-11T11:56:02Z date_published: 2014-06-01T00:00:00Z date_updated: 2023-09-11T13:38:49Z day: '01' department: - _id: UlWa doi: 10.1145/2582112.2582137 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1402.0815 month: '06' oa: 1 oa_version: Submitted Version page: 78 - 84 publication: Proceedings of the Annual Symposium on Computational Geometry publication_status: published publisher: ACM publist_id: '4849' quality_controlled: '1' related_material: record: - id: '425' relation: later_version status: public scopus_import: 1 status: public title: Embeddability in the 3 sphere is decidable type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '10894' abstract: - lang: eng text: PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations. article_processing_charge: No author: - first_name: Ulrich full_name: Bauer, Ulrich id: 2ADD483A-F248-11E8-B48F-1D18A9856A87 last_name: Bauer orcid: 0000-0002-9683-0724 - first_name: Michael full_name: Kerber, Michael last_name: Kerber - first_name: Jan full_name: Reininghaus, Jan id: 4505473A-F248-11E8-B48F-1D18A9856A87 last_name: Reininghaus - first_name: Hubert full_name: Wagner, Hubert last_name: Wagner citation: ama: 'Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: ICMS 2014: International Congress on Mathematical Software. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:10.1007/978-3-662-44199-2_24' apa: 'Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In ICMS 2014: International Congress on Mathematical Software (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_24' chicago: 'Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. https://doi.org/10.1007/978-3-662-44199-2_24.' ieee: 'U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.' ista: 'Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.' mla: 'Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.' short: 'U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143.' conference: end_date: 2014-08-09 location: Seoul, South Korea name: 'ICMS: International Congress on Mathematical Software' start_date: 2014-08-05 date_created: 2022-03-21T07:12:16Z date_published: 2014-09-01T00:00:00Z date_updated: 2023-09-20T09:42:40Z day: '01' department: - _id: HeEd doi: 10.1007/978-3-662-44199-2_24 intvolume: ' 8592' language: - iso: eng month: '09' oa_version: None page: 137-143 place: Berlin, Heidelberg publication: 'ICMS 2014: International Congress on Mathematical Software' publication_identifier: eisbn: - '9783662441992' eissn: - 1611-3349 isbn: - '9783662441985' issn: - 0302-9743 publication_status: published publisher: Springer Berlin Heidelberg quality_controlled: '1' related_material: record: - id: '1433' relation: later_version status: public scopus_import: '1' series_title: LNCS status: public title: PHAT – Persistent Homology Algorithms Toolbox type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 8592 year: '2014' ... --- _id: '5428' abstract: - lang: eng text: "Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. Again, while fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable for mean-payoff automata and the decidability is open for discounted-sum automata, whereas the (quantitative) simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games. For example, whereas for mean-payoff and discounted-sum games, the players do not need memory to play optimally; we show in contrast that for simulation games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal strategies for both players require infinite memory in general, and (ii) for discounted-sum objectives, optimal strategies need not exist for both players. While the simulation games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory requirements for mean-payoff objectives) as compared to their counterpart without Büchi acceptance conditions, we still present pseudo-polynomial time algorithms to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff and weighted discounted-sum automata." alternative_title: - IST Austria Technical Report author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: ama: Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative Fair Simulation Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-315-v1-1 apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1 chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1. ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014. ista: Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p. mla: Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1. short: K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014. date_created: 2018-12-12T11:39:16Z date_published: 2014-12-05T00:00:00Z date_updated: 2023-09-20T12:07:48Z day: '05' ddc: - '004' department: - _id: ToHe - _id: KrCh doi: 10.15479/AT:IST-2014-315-v1-1 file: - access_level: open_access checksum: b1d573bc04365625ff9974880c0aa807 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:59Z date_updated: 2020-07-14T12:46:52Z file_id: '5521' file_name: IST-2014-315-v1+1_report.pdf file_size: 531046 relation: main_file file_date_updated: 2020-07-14T12:46:52Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '26' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '315' related_material: record: - id: '1066' relation: later_version status: public status: public title: Quantitative fair simulation games type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '1887' article_processing_charge: No article_type: original author: - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: Cremer S. Gemeinsame Krankheitsabwehr in Ameisengesellschaften. Zoologie. 2014:23-30. apa: Cremer, S. (2014). Gemeinsame Krankheitsabwehr in Ameisengesellschaften. Zoologie. Deutsche Zoologische Gesellschaft. chicago: Cremer, Sylvia. “Gemeinsame Krankheitsabwehr in Ameisengesellschaften.” Zoologie. Deutsche Zoologische Gesellschaft, 2014. ieee: S. Cremer, “Gemeinsame Krankheitsabwehr in Ameisengesellschaften,” Zoologie. Deutsche Zoologische Gesellschaft, pp. 23–30, 2014. ista: Cremer S. 2014. Gemeinsame Krankheitsabwehr in Ameisengesellschaften. Zoologie., 23–30. mla: Cremer, Sylvia. “Gemeinsame Krankheitsabwehr in Ameisengesellschaften.” Zoologie, Deutsche Zoologische Gesellschaft, 2014, pp. 23–30. short: S. Cremer, Zoologie (2014) 23–30. date_created: 2018-12-11T11:54:33Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-10-17T07:54:57Z day: '01' department: - _id: SyCr language: - iso: eng main_file_link: - open_access: '1' url: https://www.dzg-ev.de/wp-content/uploads/2019/05/zoologie2014.pdf month: '01' oa: 1 oa_version: Published Version page: 23 - 30 publication: Zoologie publication_status: published publisher: Deutsche Zoologische Gesellschaft publist_id: '5208' quality_controlled: '1' status: public title: Gemeinsame Krankheitsabwehr in Ameisengesellschaften type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2175' abstract: - lang: eng text: The cerebral cortex, the seat of our cognitive abilities, is composed of an intricate network of billions of excitatory projection and inhibitory interneurons. Postmitotic cortical neurons are generated by a diverse set of neural stem cell progenitors within dedicated zones and defined periods of neurogenesis during embryonic development. Disruptions in neurogenesis can lead to alterations in the neuronal cytoarchitecture, which is thought to represent a major underlying cause for several neurological disorders, including microcephaly, autism and epilepsy. Although a number of signaling pathways regulating neurogenesis have been described, the precise cellular and molecular mechanisms regulating the functional neural stem cell properties in cortical neurogenesis remain unclear. Here, we discuss the most up-to-date strategies to monitor the fundamental mechanistic parameters of neuronal progenitor proliferation, and recent advances deciphering the logic and dynamics of neurogenesis. article_processing_charge: No author: - first_name: Maria P full_name: Postiglione, Maria P id: 2C67902A-F248-11E8-B48F-1D18A9856A87 last_name: Postiglione - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: 'Postiglione MP, Hippenmeyer S. Monitoring neurogenesis in the cerebral cortex: an update. Future Neurology. 2014;9(3):323-340. doi:10.2217/fnl.14.18' apa: 'Postiglione, M. P., & Hippenmeyer, S. (2014). Monitoring neurogenesis in the cerebral cortex: an update. Future Neurology. Future Science Group. https://doi.org/10.2217/fnl.14.18' chicago: 'Postiglione, Maria P, and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” Future Neurology. Future Science Group, 2014. https://doi.org/10.2217/fnl.14.18.' ieee: 'M. P. Postiglione and S. Hippenmeyer, “Monitoring neurogenesis in the cerebral cortex: an update,” Future Neurology, vol. 9, no. 3. Future Science Group, pp. 323–340, 2014.' ista: 'Postiglione MP, Hippenmeyer S. 2014. Monitoring neurogenesis in the cerebral cortex: an update. Future Neurology. 9(3), 323–340.' mla: 'Postiglione, Maria P., and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” Future Neurology, vol. 9, no. 3, Future Science Group, 2014, pp. 323–40, doi:10.2217/fnl.14.18.' short: M.P. Postiglione, S. Hippenmeyer, Future Neurology 9 (2014) 323–340. date_created: 2018-12-11T11:56:09Z date_published: 2014-05-01T00:00:00Z date_updated: 2023-10-17T08:34:27Z day: '01' ddc: - '570' department: - _id: SiHi doi: 10.2217/fnl.14.18 ec_funded: 1 file: - access_level: open_access checksum: ba06659ecadabceec9a37dd8c4586dce content_type: application/pdf creator: system date_created: 2018-12-12T10:10:25Z date_updated: 2020-07-14T12:45:31Z file_id: '4812' file_name: IST-2016-528-v1+1_fnl.14.18.pdf file_size: 3848424 relation: main_file file_date_updated: 2020-07-14T12:45:31Z has_accepted_license: '1' intvolume: ' 9' issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '05' oa: 1 oa_version: Published Version page: 323 - 340 project: - _id: 25D61E48-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618444' name: Molecular Mechanisms of Cerebral Cortex Development publication: Future Neurology publication_identifier: eissn: - 1748-6971 issn: - 1479-6708 publication_status: published publisher: Future Science Group publist_id: '4806' pubrep_id: '528' quality_controlled: '1' scopus_import: '1' status: public title: 'Monitoring neurogenesis in the cerebral cortex: an update' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2014' ... --- _id: '1913' abstract: - lang: eng text: 'Deposits of phosphorylated tau protein and convergence of pathology in the hippocampus are the hallmarks of neurodegenerative tauopathies. Thus we aimed to evaluate whether regional and cellular vulnerability patterns in the hippocampus distinguish tauopathies or are influenced by their concomitant presence. Methods: We created a heat map of phospho-tau (AT8) immunoreactivity patterns in 24 hippocampal subregions/layers in individuals with Alzheimer''s disease (AD)-related neurofibrillary degeneration (n = 40), Pick''s disease (n = 8), progressive supranuclear palsy (n = 7), corticobasal degeneration (n = 6), argyrophilic grain disease (AGD, n = 18), globular glial tauopathy (n = 5), and tau-astrogliopathy of the elderly (n = 10). AT8 immunoreactivity patterns were compared by mathematical analysis. Results: Our study reveals disease-specific hot spots and regional selective vulnerability for these disorders. The pattern of hippocampal AD-related tau pathology is strongly influenced by concomitant AGD. Mathematical analysis reveals that hippocampal involvement in primary tauopathies is distinguishable from early-stage AD-related neurofibrillary degeneration. Conclusion: Our data demonstrate disease-specific AT8 immunoreactivity patterns and hot spots in the hippocampus even in tauopathies, which primarily do not affect the hippocampus. These hot spots can be shifted to other regions by the co-occurrence of tauopathies like AGD. Our observations support the notion that globular glial tauopathies and tau-astrogliopathy of the elderly are distinct entities.' acknowledgement: This study was supported by the European Commission’s 7th Framework Programme under GA No. 278486, ‘DEVELAGE’. article_processing_charge: No article_type: original author: - first_name: Ivan full_name: Milenković, Ivan last_name: Milenković - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 - first_name: Gábor full_name: Kovács, Gábor last_name: Kovács citation: ama: Milenković I, Petrov T, Kovács G. Patterns of hippocampal tau pathology differentiate neurodegenerative dementias. Dementia and Geriatric Cognitive Disorders. 2014;38(5-6):375-388. doi:10.1159/000365548 apa: Milenković, I., Petrov, T., & Kovács, G. (2014). Patterns of hippocampal tau pathology differentiate neurodegenerative dementias. Dementia and Geriatric Cognitive Disorders. Karger Publishers. https://doi.org/10.1159/000365548 chicago: Milenković, Ivan, Tatjana Petrov, and Gábor Kovács. “Patterns of Hippocampal Tau Pathology Differentiate Neurodegenerative Dementias.” Dementia and Geriatric Cognitive Disorders. Karger Publishers, 2014. https://doi.org/10.1159/000365548. ieee: I. Milenković, T. Petrov, and G. Kovács, “Patterns of hippocampal tau pathology differentiate neurodegenerative dementias,” Dementia and Geriatric Cognitive Disorders, vol. 38, no. 5–6. Karger Publishers, pp. 375–388, 2014. ista: Milenković I, Petrov T, Kovács G. 2014. Patterns of hippocampal tau pathology differentiate neurodegenerative dementias. Dementia and Geriatric Cognitive Disorders. 38(5–6), 375–388. mla: Milenković, Ivan, et al. “Patterns of Hippocampal Tau Pathology Differentiate Neurodegenerative Dementias.” Dementia and Geriatric Cognitive Disorders, vol. 38, no. 5–6, Karger Publishers, 2014, pp. 375–88, doi:10.1159/000365548. short: I. Milenković, T. Petrov, G. Kovács, Dementia and Geriatric Cognitive Disorders 38 (2014) 375–388. date_created: 2018-12-11T11:54:41Z date_published: 2014-11-07T00:00:00Z date_updated: 2023-10-17T10:21:17Z day: '07' department: - _id: CaGu doi: 10.1159/000365548 external_id: pmid: - '25195847' intvolume: ' 38' issue: 5-6 language: - iso: eng main_file_link: - open_access: '1' url: https://kops.uni-konstanz.de/bitstream/123456789/42127/1/Milenkovic_2-17ivylo2up0798.pdf month: '11' oa: 1 oa_version: Published Version page: 375 - 388 pmid: 1 publication: Dementia and Geriatric Cognitive Disorders publication_identifier: issn: - 1420-8008 publication_status: published publisher: Karger Publishers publist_id: '5181' quality_controlled: '1' scopus_import: '1' status: public title: Patterns of hippocampal tau pathology differentiate neurodegenerative dementias type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2014' ... --- _id: '1507' abstract: - lang: eng text: The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the symmetry class of the matrix and otherwise are independent of the details of the distribution. We present the recent solution to this half-century old conjecture. We explain how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also show related results for log-gases that represent a universal model for strongly correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss the extensions of these universality results to more realistic physical systems such as random band matrices. acknowledgement: The author is partially supported by SFB-TR 12 Grant of the German Research Council. article_processing_charge: No 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 citation: ama: 'Erdös L. Random matrices, log-gases and Hölder regularity. In: Proceedings of the International Congress of Mathematicians. Vol 3. International Congress of Mathematicians; 2014:214-236.' apa: 'Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In Proceedings of the International Congress of Mathematicians (Vol. 3, pp. 214–236). Seoul, Korea: International Congress of Mathematicians.' chicago: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In Proceedings of the International Congress of Mathematicians, 3:214–36. International Congress of Mathematicians, 2014. ieee: L. Erdös, “Random matrices, log-gases and Hölder regularity,” in Proceedings of the International Congress of Mathematicians, Seoul, Korea, 2014, vol. 3, pp. 214–236. ista: 'Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings of the International Congress of Mathematicians. ICM: International Congress of Mathematicians vol. 3, 214–236.' mla: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” Proceedings of the International Congress of Mathematicians, vol. 3, International Congress of Mathematicians, 2014, pp. 214–36. short: L. Erdös, in:, Proceedings of the International Congress of Mathematicians, International Congress of Mathematicians, 2014, pp. 214–236. conference: end_date: 2014-08-21 location: Seoul, Korea name: 'ICM: International Congress of Mathematicians' start_date: 2014-08-13 date_created: 2018-12-11T11:52:25Z date_published: 2014-08-01T00:00:00Z date_updated: 2023-10-17T11:12:55Z day: '01' department: - _id: LaEr ec_funded: 1 intvolume: ' 3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1407.5752 month: '08' oa: 1 oa_version: Submitted Version page: 214 - 236 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Proceedings of the International Congress of Mathematicians publication_status: published publisher: International Congress of Mathematicians publist_id: '5670' quality_controlled: '1' scopus_import: '1' status: public title: Random matrices, log-gases and Hölder regularity type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2014' ... --- _id: '8044' abstract: - lang: eng text: Many questions concerning models in quantum mechanics require a detailed analysis of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable Hilbert space. Of particular relevance for an understanding of the low-temperature properties of a system is the structure of the excitation spectrum, which is the part of the spectrum close to the spectral bottom. We present recent progress on this question for bosonic many-body quantum systems with weak two-body interactions. Such system are currently of great interest, due to their experimental realization in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations, which predicts that the low-energy spectrum is made up of sums of elementary excitations, with linear dispersion law at low momentum. The latter property is crucial for the superfluid behavior the system. 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 citation: ama: 'Seiringer R. Structure of the excitation spectrum for many-body quantum systems. In: Proceeding of the International Congress of Mathematicans. Vol 3. International Congress of Mathematicians; 2014:1175-1194.' apa: 'Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum systems. In Proceeding of the International Congress of Mathematicans (Vol. 3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.' chicago: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” In Proceeding of the International Congress of Mathematicans, 3:1175–94. International Congress of Mathematicians, 2014. ieee: R. Seiringer, “Structure of the excitation spectrum for many-body quantum systems,” in Proceeding of the International Congress of Mathematicans, Seoul, South Korea, 2014, vol. 3, pp. 1175–1194. ista: 'Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum systems. Proceeding of the International Congress of Mathematicans. ICM: International Congress of Mathematicans vol. 3, 1175–1194.' mla: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” Proceeding of the International Congress of Mathematicans, vol. 3, International Congress of Mathematicians, 2014, pp. 1175–94. short: R. Seiringer, in:, Proceeding of the International Congress of Mathematicans, International Congress of Mathematicians, 2014, pp. 1175–1194. conference: end_date: 2014-08-21 location: Seoul, South Korea name: 'ICM: International Congress of Mathematicans' start_date: 2014-08-13 date_created: 2020-06-29T07:59:35Z date_published: 2014-08-01T00:00:00Z date_updated: 2023-10-17T11:12:33Z day: '01' department: - _id: RoSe intvolume: ' 3' language: - iso: eng main_file_link: - open_access: '1' url: http://www.icm2014.org/en/vod/proceedings.html month: '08' oa: 1 oa_version: Published Version page: 1175-1194 publication: Proceeding of the International Congress of Mathematicans publication_identifier: isbn: - '9788961058063' publication_status: published publisher: International Congress of Mathematicians quality_controlled: '1' scopus_import: '1' status: public title: Structure of the excitation spectrum for many-body quantum systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2014' ... --- _id: '2160' abstract: - lang: eng text: Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods. article_processing_charge: No author: - first_name: Anastasia full_name: Pentina, Anastasia id: 42E87FC6-F248-11E8-B48F-1D18A9856A87 last_name: Pentina - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.' apa: 'Pentina, A., & Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press.' chicago: Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014. ieee: 'A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.' ista: 'Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999.' mla: Pentina, Anastasia, and Christoph Lampert. A PAC-Bayesian Bound for Lifelong Learning. Vol. 32, ML Research Press, 2014, pp. 991–99. short: A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999. conference: end_date: 2014-06-26 location: Beijing, China name: 'ICML: International Conference on Machine Learning' start_date: 2014-06-21 date_created: 2018-12-11T11:56:03Z date_published: 2014-05-10T00:00:00Z date_updated: 2023-10-17T11:54:24Z day: '10' department: - _id: ChLa intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/citation.cfm?id=3045003 month: '05' oa: 1 oa_version: Submitted Version page: 991 - 999 publication_status: published publisher: ML Research Press publist_id: '4844' quality_controlled: '1' scopus_import: '1' status: public title: A PAC-Bayesian bound for Lifelong Learning type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2014' ... --- _id: '1403' abstract: - lang: eng text: A variety of developmental and disease related processes depend on epithelial cell sheet spreading. In order to gain insight into the biophysical mechanism(s) underlying the tissue morphogenesis we studied the spreading of an epithelium during the early development of the zebrafish embryo. In zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the yolk cell to completely engulf it at the end of gastrulation. Previous studies have proposed that an actomyosin ring forming within the yolk syncytial layer (YSL) acts as purse string that through constriction along its circumference pulls on the margin of the EVL. Direct biophysical evidence for this hypothesis has however been missing. The aim of the thesis was to understand how the actomyosin ring may generate pulling forces onto the EVL and what cellular mechanism(s) may facilitate the spreading of the epithelium. Using laser ablation to measure cortical tension within the actomyosin ring we found an anisotropic tension distribution, which was highest along the circumference of the ring. However the low degree of anisotropy was incompatible with the actomyosin ring functioning as a purse string only. Additionally, we observed retrograde cortical flow from vegetal parts of the ring into the EVL margin. Interpreting the experimental data using a theoretical distribution that models the tissues as active viscous gels led us to proposen that the actomyosin ring has a twofold contribution to EVL epiboly. It not only acts as a purse string through constriction along its circumference, but in addition constriction along the width of the ring generates pulling forces through friction-resisted cortical flow. Moreover, when rendering the purse string mechanism unproductive EVL epiboly proceeded normally indicating that the flow-friction mechanism is sufficient to drive the process. Aiming to understand what cellular mechanism(s) may facilitate the spreading of the epithelium we found that tension-oriented EVL cell divisions limit tissue anisotropy by releasing tension along the division axis and promote epithelial spreading. Notably, EVL cells undergo ectopic cell fusion in conditions in which oriented-cell division is impaired or the epithelium is mechanically challenged. Taken together our study of EVL epiboly suggests a novel mechanism of force generation for actomyosin rings through friction-resisted cortical flow and highlights the importance of tension-oriented cell divisions in epithelial morphogenesis. acknowledged_ssus: - _id: SSU alternative_title: - IST Austria Thesis author: - first_name: Martin full_name: Behrndt, Martin id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87 last_name: Behrndt citation: ama: Behrndt M. Forces driving epithelial spreading in zebrafish epiboly. 2014. apa: Behrndt, M. (2014). Forces driving epithelial spreading in zebrafish epiboly. IST Austria. chicago: Behrndt, Martin. “Forces Driving Epithelial Spreading in Zebrafish Epiboly.” IST Austria, 2014. ieee: M. Behrndt, “Forces driving epithelial spreading in zebrafish epiboly,” IST Austria, 2014. ista: Behrndt M. 2014. Forces driving epithelial spreading in zebrafish epiboly. IST Austria. mla: Behrndt, Martin. Forces Driving Epithelial Spreading in Zebrafish Epiboly. IST Austria, 2014. short: M. Behrndt, Forces Driving Epithelial Spreading in Zebrafish Epiboly, IST Austria, 2014. date_created: 2018-12-11T11:51:49Z date_published: 2014-08-01T00:00:00Z date_updated: 2023-10-17T12:16:58Z day: '01' department: - _id: CaHe language: - iso: eng month: '08' oa_version: None page: '91' publication_status: published publisher: IST Austria publist_id: '5804' related_material: record: - id: '2282' relation: part_of_dissertation status: public - id: '2950' relation: part_of_dissertation status: public - id: '3373' relation: part_of_dissertation status: public status: public supervisor: - 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 title: Forces driving epithelial spreading in zebrafish epiboly type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '1888' abstract: - lang: ger text: 'Im Rahmen meiner Arbeit mit der kollektiven Krankheitsabwehr in Ameisengesellschaften interessiert mich vor allem, wie sich die Kolonien als Ganzes gegen Krankheiten wehren können. Warum ist dieses Thema der Krankheitsdynamik in Gruppen so wichtig? Ein Vergleich von solitär lebenden Individuen mit Individuen, die in sozialen Gruppen zusammenleben, zeigt die Kosten und die Vorteile des Gruppenlebens: Einerseits haben Individuen in sozialen Gruppen aufgrund der hohen Dichte, in der die Tiere zusammenleben, den hohen Interaktionsraten, die sie miteinander haben, und der engen Verwandtschaft, die sie verbindet, ein höheres Ansteckungsrisiko. Andererseits kann die individuelle Krankheitsabwehr durch die kollektive Abwehr in den Gruppen ergänzt werden.' alternative_title: - Rundgespräche der Kommission für Ökologie article_processing_charge: No author: - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: 'Cremer S. Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt  Bayerische Akademie der Wissenschaften. In: Soziale Insekten in Einer Sich Wandelnden Welt. Vol 43. Verlag Dr. Friedrich Pfeil; 2014:65-72.' apa: 'Cremer, S. (2014). Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt  Bayerische Akademie der Wissenschaften. In Soziale Insekten in einer sich wandelnden Welt (Vol. 43, pp. 65–72). Verlag Dr. Friedrich Pfeil.' chicago: 'Cremer, Sylvia. “Soziale Immunität: Wie Sich Der Staat Gegen Pathogene Wehrt  Bayerische Akademie Der Wissenschaften.” In Soziale Insekten in Einer Sich Wandelnden Welt, 43:65–72. Verlag Dr. Friedrich Pfeil, 2014.' ieee: 'S. Cremer, “Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt  Bayerische Akademie der Wissenschaften,” in Soziale Insekten in einer sich wandelnden Welt, vol. 43, Verlag Dr. Friedrich Pfeil, 2014, pp. 65–72.' ista: 'Cremer S. 2014.Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt  Bayerische Akademie der Wissenschaften. In: Soziale Insekten in einer sich wandelnden Welt. Rundgespräche der Kommission für Ökologie, vol. 43, 65–72.' mla: 'Cremer, Sylvia. “Soziale Immunität: Wie Sich Der Staat Gegen Pathogene Wehrt  Bayerische Akademie Der Wissenschaften.” Soziale Insekten in Einer Sich Wandelnden Welt, vol. 43, Verlag Dr. Friedrich Pfeil, 2014, pp. 65–72.' short: S. Cremer, in:, Soziale Insekten in Einer Sich Wandelnden Welt, Verlag Dr. Friedrich Pfeil, 2014, pp. 65–72. date_created: 2018-12-11T11:54:33Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-10-17T12:28:45Z day: '01' department: - _id: SyCr intvolume: ' 43' language: - iso: eng month: '01' oa_version: None page: 65 - 72 publication: Soziale Insekten in einer sich wandelnden Welt publication_identifier: issn: - 2366-2875 publication_status: published publisher: Verlag Dr. Friedrich Pfeil publist_id: '5207' quality_controlled: '1' status: public title: 'Soziale Immunität: Wie sich der Staat gegen Pathogene wehrt Bayerische Akademie der Wissenschaften' type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2014' ... --- _id: '2012' abstract: - lang: eng text: The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice. acknowledgement: We thank Herbert Edelsbrunner for his valuable discussions and ideas on the topic of this paper. The second author has been supported by the Max Planck Center for Visual Computing and Communication article_number: '1401.0468' article_processing_charge: No author: - first_name: Mabel full_name: Iglesias Ham, Mabel id: 41B58C0C-F248-11E8-B48F-1D18A9856A87 last_name: Iglesias Ham - first_name: Michael full_name: Kerber, Michael last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 citation: ama: Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv. doi:10.48550/arXiv.1401.0468 apa: Iglesias Ham, M., Kerber, M., & Uhler, C. (n.d.). Sphere packing with limited overlap. arXiv. https://doi.org/10.48550/arXiv.1401.0468 chicago: Iglesias Ham, Mabel, Michael Kerber, and Caroline Uhler. “Sphere Packing with Limited Overlap.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1401.0468. ieee: M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” arXiv. . ista: Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468. mla: Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.” ArXiv, 1401.0468, doi:10.48550/arXiv.1401.0468. short: M. Iglesias Ham, M. Kerber, C. Uhler, ArXiv (n.d.). date_created: 2018-12-11T11:55:12Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-10-18T08:06:45Z day: '01' department: - _id: HeEd - _id: CaUh doi: 10.48550/arXiv.1401.0468 external_id: arxiv: - '1401.0468' language: - iso: eng main_file_link: - open_access: '1' url: http://cccg.ca/proceedings/2014/papers/paper23.pdf month: '01' oa: 1 oa_version: Submitted Version publication: arXiv publication_status: submitted publist_id: '5064' status: public title: Sphere packing with limited overlap type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2281' abstract: - lang: eng text: We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential. article_processing_charge: No article_type: original author: - first_name: Yujin full_name: Guo, Yujin last_name: Guo - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 2014;104(2):141-156. doi:10.1007/s11005-013-0667-9 apa: Guo, Y., & Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-013-0667-9 chicago: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-013-0667-9. ieee: Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” Letters in Mathematical Physics, vol. 104, no. 2. Springer, pp. 141–156, 2014. ista: Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156. mla: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” Letters in Mathematical Physics, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:10.1007/s11005-013-0667-9. short: Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156. date_created: 2018-12-11T11:56:44Z date_published: 2014-02-01T00:00:00Z date_updated: 2024-02-14T12:19:42Z day: '01' department: - _id: RoSe doi: 10.1007/s11005-013-0667-9 external_id: arxiv: - '1301.5682' intvolume: ' 104' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1301.5682 month: '02' oa: 1 oa_version: Preprint page: 141 - 156 publication: Letters in Mathematical Physics publication_status: published publisher: Springer publist_id: '4653' quality_controlled: '1' scopus_import: '1' status: public title: On the mass concentration for Bose-Einstein condensates with attractive interactions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 104 year: '2014' ... --- _id: '2257' abstract: - lang: eng text: 'Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population''s capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction.' acknowledgement: "\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508, the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation, ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES: ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651." article_number: e1003408 author: - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Olivier full_name: Marre, Olivier last_name: Marre - first_name: Dario full_name: Amodei, Dario last_name: Amodei - first_name: Elad full_name: Schneidman, Elad last_name: Schneidman - first_name: William full_name: Bialek, William last_name: Bialek - first_name: Michael full_name: Berry, Michael last_name: Berry citation: ama: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 2014;10(1). doi:10.1371/journal.pcbi.1003408 apa: Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., & Berry, M. (2014). Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003408 chicago: Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” PLoS Computational Biology. Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003408. ieee: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching for collective behavior in a large network of sensory neurons,” PLoS Computational Biology, vol. 10, no. 1. Public Library of Science, 2014. ista: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 10(1), e1003408. mla: Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” PLoS Computational Biology, vol. 10, no. 1, e1003408, Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003408. short: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014). date_created: 2018-12-11T11:56:36Z date_published: 2014-01-02T00:00:00Z date_updated: 2024-02-21T13:46:14Z day: '02' ddc: - '570' department: - _id: GaTk doi: 10.1371/journal.pcbi.1003408 file: - access_level: open_access checksum: c720222c5e924a4acb17f23b9381a6ca content_type: application/pdf creator: system date_created: 2018-12-12T10:12:46Z date_updated: 2020-07-14T12:45:35Z file_id: '4965' file_name: IST-2016-436-v1+1_journal.pcbi.1003408.pdf file_size: 2194790 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 10' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://repository.ist.ac.at/id/eprint/436 month: '01' oa: 1 oa_version: Published Version publication: PLoS Computational Biology publication_identifier: issn: - 1553734X publication_status: published publisher: Public Library of Science publist_id: '4689' pubrep_id: '436' quality_controlled: '1' related_material: record: - id: '5562' relation: popular_science status: public scopus_import: 1 status: public title: Searching for collective behavior in a large network of sensory neurons 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: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2014' ... --- _id: '1999' abstract: - lang: eng text: Selection for disease control is believed to have contributed to shape the organisation of insect societies — leading to interaction patterns that mitigate disease transmission risk within colonies, conferring them ‘organisational immunity’. Recent studies combining epidemiological models with social network analysis have identified general properties of interaction networks that may hinder propagation of infection within groups. These can be prophylactic and/or induced upon pathogen exposure. Here we review empirical evidence for these two types of organisational immunity in social insects and describe the individual-level behaviours that underlie it. We highlight areas requiring further investigation, and emphasise the need for tighter links between theory and empirical research and between individual-level and collective-level analyses. author: - first_name: Nathalie full_name: Stroeymeyt, Nathalie last_name: Stroeymeyt - first_name: Barbara E full_name: Casillas Perez, Barbara E id: 351ED2AA-F248-11E8-B48F-1D18A9856A87 last_name: Casillas Perez - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: Stroeymeyt N, Casillas Perez BE, Cremer S. Organisational immunity in social insects. Current Opinion in Insect Science. 2014;5(1):1-15. doi:10.1016/j.cois.2014.09.001 apa: Stroeymeyt, N., Casillas Perez, B. E., & Cremer, S. (2014). Organisational immunity in social insects. Current Opinion in Insect Science. Elsevier. https://doi.org/10.1016/j.cois.2014.09.001 chicago: Stroeymeyt, Nathalie, Barbara E Casillas Perez, and Sylvia Cremer. “Organisational Immunity in Social Insects.” Current Opinion in Insect Science. Elsevier, 2014. https://doi.org/10.1016/j.cois.2014.09.001. ieee: N. Stroeymeyt, B. E. Casillas Perez, and S. Cremer, “Organisational immunity in social insects,” Current Opinion in Insect Science, vol. 5, no. 1. Elsevier, pp. 1–15, 2014. ista: Stroeymeyt N, Casillas Perez BE, Cremer S. 2014. Organisational immunity in social insects. Current Opinion in Insect Science. 5(1), 1–15. mla: Stroeymeyt, Nathalie, et al. “Organisational Immunity in Social Insects.” Current Opinion in Insect Science, vol. 5, no. 1, Elsevier, 2014, pp. 1–15, doi:10.1016/j.cois.2014.09.001. short: N. Stroeymeyt, B.E. Casillas Perez, S. Cremer, Current Opinion in Insect Science 5 (2014) 1–15. date_created: 2018-12-11T11:55:08Z date_published: 2014-11-01T00:00:00Z date_updated: 2024-03-28T23:30:05Z day: '01' department: - _id: SyCr doi: 10.1016/j.cois.2014.09.001 ec_funded: 1 intvolume: ' 5' issue: '1' language: - iso: eng month: '11' oa_version: None page: 1 - 15 project: - _id: 25DC711C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '243071' name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects' publication: Current Opinion in Insect Science publication_status: published publisher: Elsevier publist_id: '5080' quality_controlled: '1' related_material: record: - id: '6383' relation: dissertation_contains - id: '6435' relation: dissertation_contains status: public scopus_import: 1 status: public title: Organisational immunity in social insects type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2014' ... --- _id: '10396' abstract: - lang: eng text: Stimfit is a free cross-platform software package for viewing and analyzing electrophysiological data. It supports most standard file types for cellular neurophysiology and other biomedical formats. Its analysis algorithms have been used and validated in several experimental laboratories. Its embedded Python scripting interface makes Stimfit highly extensible and customizable. article_number: '000010151520134181' article_processing_charge: No article_type: original author: - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 - first_name: C. full_name: Schmidt-Hieber, C. last_name: Schmidt-Hieber - first_name: S. J. full_name: Guzman, S. J. last_name: Guzman citation: ama: 'Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. Biomedical Engineering / Biomedizinische Technik. 2013;58(SI-1-Track-G). doi:10.1515/bmt-2013-4181' apa: 'Schlögl, A., Jonas, P. M., Schmidt-Hieber, C., & Guzman, S. J. (2013). Stimfit: A fast visualization and analysis environment for cellular neurophysiology. Biomedical Engineering / Biomedizinische Technik. Graz, Austria: De Gruyter. https://doi.org/10.1515/bmt-2013-4181' chicago: 'Schlögl, Alois, Peter M Jonas, C. Schmidt-Hieber, and S. J. Guzman. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” Biomedical Engineering / Biomedizinische Technik. De Gruyter, 2013. https://doi.org/10.1515/bmt-2013-4181.' ieee: 'A. Schlögl, P. M. Jonas, C. Schmidt-Hieber, and S. J. Guzman, “Stimfit: A fast visualization and analysis environment for cellular neurophysiology,” Biomedical Engineering / Biomedizinische Technik, vol. 58, no. SI-1-Track-G. De Gruyter, 2013.' ista: 'Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. 2013. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. Biomedical Engineering / Biomedizinische Technik. 58(SI-1-Track-G), 000010151520134181.' mla: 'Schlögl, Alois, et al. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” Biomedical Engineering / Biomedizinische Technik, vol. 58, no. SI-1-Track-G, 000010151520134181, De Gruyter, 2013, doi:10.1515/bmt-2013-4181.' short: A. Schlögl, P.M. Jonas, C. Schmidt-Hieber, S.J. Guzman, Biomedical Engineering / Biomedizinische Technik 58 (2013). conference: end_date: 2013-09-21 location: Graz, Austria name: 'BMT: Biomedizinische Technik ' start_date: 2013-09-19 date_created: 2021-12-01T14:35:35Z date_published: 2013-08-01T00:00:00Z date_updated: 2021-12-02T12:51:12Z day: '01' ddc: - '005' - '610' department: - _id: PeJo doi: 10.1515/bmt-2013-4181 external_id: pmid: - '24042795' file: - access_level: open_access checksum: cdfc5339b530a25d6079f7223f0b1f16 content_type: application/pdf creator: schloegl date_created: 2021-12-01T14:38:08Z date_updated: 2021-12-01T14:38:08Z file_id: '10397' file_name: Schloegl_Abstract-BMT2013.pdf file_size: 149825 relation: main_file success: 1 file_date_updated: 2021-12-01T14:38:08Z has_accepted_license: '1' intvolume: ' 58' issue: SI-1-Track-G keyword: - biomedical engineering - data analysis - free software language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version pmid: 1 publication: Biomedical Engineering / Biomedizinische Technik publication_identifier: eissn: - 1862-278X issn: - 0013-5585 publication_status: published publisher: De Gruyter quality_controlled: '1' status: public title: 'Stimfit: A fast visualization and analysis environment for cellular neurophysiology' type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 58 year: '2013' ... --- _id: '10895' abstract: - lang: eng text: 'Due to their sessile lifestyles, plants need to deal with the limitations and stresses imposed by the changing environment. Plants cope with these by a remarkable developmental flexibility, which is embedded in their strategy to survive. Plants can adjust their size, shape and number of organs, bend according to gravity and light, and regenerate tissues that were damaged, utilizing a coordinating, intercellular signal, the plant hormone, auxin. Another versatile signal is the cation, Ca2+, which is a crucial second messenger for many rapid cellular processes during responses to a wide range of endogenous and environmental signals, such as hormones, light, drought stress and others. Auxin is a good candidate for one of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling is poorly understood. Here, we will provide an overview of possible developmental and physiological roles, as well as mechanisms underlying the interconnection of Ca2+ and auxin signaling. ' article_processing_charge: No article_type: original author: - first_name: Steffen full_name: Vanneste, Steffen last_name: Vanneste - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: 'Vanneste S, Friml J. Calcium: The missing link in auxin action. Plants. 2013;2(4):650-675. doi:10.3390/plants2040650' apa: 'Vanneste, S., & Friml, J. (2013). Calcium: The missing link in auxin action. Plants. MDPI. https://doi.org/10.3390/plants2040650' chicago: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” Plants. MDPI, 2013. https://doi.org/10.3390/plants2040650.' ieee: 'S. Vanneste and J. Friml, “Calcium: The missing link in auxin action,” Plants, vol. 2, no. 4. MDPI, pp. 650–675, 2013.' ista: 'Vanneste S, Friml J. 2013. Calcium: The missing link in auxin action. Plants. 2(4), 650–675.' mla: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” Plants, vol. 2, no. 4, MDPI, 2013, pp. 650–75, doi:10.3390/plants2040650.' short: S. Vanneste, J. Friml, Plants 2 (2013) 650–675. date_created: 2022-03-21T07:13:49Z date_published: 2013-10-21T00:00:00Z date_updated: 2022-03-21T12:15:29Z day: '21' ddc: - '580' department: - _id: JiFr doi: 10.3390/plants2040650 external_id: pmid: - '27137397' file: - access_level: open_access checksum: fb4ff2e820e344e253c9197544610be6 content_type: application/pdf creator: dernst date_created: 2022-03-21T12:12:56Z date_updated: 2022-03-21T12:12:56Z file_id: '10916' file_name: 2013_Plants_Vanneste.pdf file_size: 670188 relation: main_file success: 1 file_date_updated: 2022-03-21T12:12:56Z has_accepted_license: '1' intvolume: ' 2' issue: '4' keyword: - Plant Science - Ecology - Ecology - Evolution - Behavior and Systematics language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '10' oa: 1 oa_version: Published Version page: 650-675 pmid: 1 publication: Plants publication_identifier: issn: - 2223-7747 publication_status: published publisher: MDPI quality_controlled: '1' scopus_import: '1' status: public title: 'Calcium: The missing link in auxin action' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2013' ... --- _id: '10898' abstract: - lang: eng text: A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered. article_number: '17' article_processing_charge: No author: - first_name: Andreas full_name: Haas, Andreas last_name: Haas - first_name: Michael full_name: Lippautz, Michael last_name: Lippautz - 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: Hannes full_name: Payer, Hannes last_name: Payer - first_name: Ana full_name: Sokolova, Ana last_name: Sokolova - first_name: Christoph M. full_name: Kirsch, Christoph M. last_name: Kirsch - first_name: Ali full_name: Sezgin, Ali id: 4C7638DA-F248-11E8-B48F-1D18A9856A87 last_name: Sezgin citation: ama: 'Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press; 2013. doi:10.1145/2482767.2482789' apa: 'Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., & Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. Ischia, Italy: ACM Press. https://doi.org/10.1145/2482767.2482789' chicago: 'Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press, 2013. https://doi.org/10.1145/2482767.2482789.' ieee: 'A. Haas et al., “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013, no. 5.' ista: 'Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.' mla: 'Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM Press, 2013, doi:10.1145/2482767.2482789.' short: A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013. conference: end_date: 2013-05-16 location: Ischia, Italy name: 'CF: Conference on Computing Frontiers' start_date: 2013-05-14 date_created: 2022-03-21T07:33:22Z date_published: 2013-05-01T00:00:00Z date_updated: 2022-06-21T08:01:19Z day: '01' department: - _id: ToHe doi: 10.1145/2482767.2482789 issue: '5' language: - iso: eng month: '05' oa_version: None publication: Proceedings of the ACM International Conference on Computing Frontiers - CF '13 publication_identifier: isbn: - 978-145032053-5 publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: 'Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '10899' article_processing_charge: No author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: 'Barton NH. Differentiation. In: Encyclopedia of Biodiversity. 2nd ed. Elsevier; 2013:508-515. doi:10.1016/b978-0-12-384719-5.00031-9' apa: Barton, N. H. (2013). Differentiation. In Encyclopedia of Biodiversity (2nd ed., pp. 508–515). Elsevier. https://doi.org/10.1016/b978-0-12-384719-5.00031-9 chicago: Barton, Nicholas H. “Differentiation.” In Encyclopedia of Biodiversity, 2nd ed., 508–15. Elsevier, 2013. https://doi.org/10.1016/b978-0-12-384719-5.00031-9. ieee: N. H. Barton, “Differentiation,” in Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–515. ista: 'Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.' mla: Barton, Nicholas H. “Differentiation.” Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–15, doi:10.1016/b978-0-12-384719-5.00031-9. short: N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–515. date_created: 2022-03-21T07:46:22Z date_published: 2013-01-01T00:00:00Z date_updated: 2022-06-20T09:18:06Z day: '01' department: - _id: NiBa doi: 10.1016/b978-0-12-384719-5.00031-9 edition: '2' keyword: - Adaptive landscape - Cline - Coalescent process - Gene flow - Hybrid zone - Local adaptation - Natural selection - Neutral theory - Population structure - Speciation language: - iso: eng month: '01' oa_version: None page: 508-515 publication: Encyclopedia of Biodiversity publication_identifier: isbn: - 978-0-12-384720-1 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Differentiation type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '1374' abstract: - lang: eng text: 'We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.' alternative_title: - LIPIcs author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathanaël full_name: Fijalkow, Nathanaël last_name: Fijalkow citation: ama: 'Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: 22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181' apa: 'Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181' chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181. ieee: K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196. ista: 'Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.' mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181. short: K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196. conference: end_date: 2013-09-05 location: Torino, Italy name: 'CSL: Computer Science Logic' start_date: 203-09-02 date_created: 2018-12-11T11:51:39Z date_published: 2013-09-01T00:00:00Z date_updated: 2021-01-12T06:50:14Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.CSL.2013.181 ec_funded: 1 file: - access_level: open_access checksum: b7091a3866db573c0db5ec486952255e content_type: application/pdf creator: system date_created: 2018-12-12T10:13:38Z date_updated: 2020-07-14T12:44:47Z file_id: '5023' file_name: IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf file_size: 547296 relation: main_file file_date_updated: 2020-07-14T12:44:47Z has_accepted_license: '1' intvolume: ' 23' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 181 - 196 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: 22nd EACSL Annual Conference on Computer Science Logic publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '5837' pubrep_id: '624' quality_controlled: '1' scopus_import: 1 series_title: Leibniz International Proceedings in Informatics status: public title: Infinite-state games with finitary conditions 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: '1385' abstract: - lang: eng text: It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results. acknowledgement: "This research was supported by the European Commission through project\r\nDIAMOND \ (FP7-2009-IST-4-248613), and QUAINT (I774-N23), " author: - first_name: Georg full_name: Hofferek, Georg last_name: Hofferek - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Bettina full_name: Könighofer, Bettina last_name: Könighofer - first_name: Jie full_name: Jiang, Jie last_name: Jiang - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem citation: ama: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: 2013 Formal Methods in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394' apa: 'Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394' chicago: Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679394. ieee: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in 2013 Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 77–84. ista: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.' mla: Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394. short: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84. conference: end_date: 2013-10-23 location: Portland, OR, United States name: 'FMCAD: Formal Methods in Computer-Aided Design' start_date: 2013-10-20 date_created: 2018-12-11T11:51:43Z date_published: 2013-12-11T00:00:00Z date_updated: 2021-01-12T06:50:19Z day: '11' department: - _id: ToHe doi: 10.1109/FMCAD.2013.6679394 ec_funded: 1 external_id: arxiv: - '1308.4767' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1308.4767 month: '12' oa: 1 oa_version: Preprint page: 77 - 84 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: 2013 Formal Methods in Computer-Aided Design publication_status: published publisher: IEEE publist_id: '5825' quality_controlled: '1' status: public title: Synthesizing multiple boolean functions using interpolation on a single proof type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '1387' abstract: - lang: eng text: Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata. acknowledgement: and ERC Grant QUALITY. alternative_title: - LNCS article_processing_charge: No author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Denis full_name: Kuperberg, Denis last_name: Kuperberg - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Michał full_name: Skrzypczak, Michał last_name: Skrzypczak citation: ama: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11 apa: 'Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11' chicago: Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11. ieee: U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013. ista: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100. mla: Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11. short: U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100. 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:51:44Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:09Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-39212-2_11 ec_funded: 1 file: - access_level: open_access checksum: 98bc02e3793072e279ec8d364b381ff3 content_type: application/pdf creator: dernst date_created: 2020-05-15T11:05:50Z date_updated: 2020-07-14T12:44:48Z file_id: '7857' file_name: 2013_ICALP_Boker.pdf file_size: 276982 relation: main_file file_date_updated: 2020-07-14T12:44:48Z has_accepted_license: '1' intvolume: ' 7966' issue: PART 2 language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 89 - 100 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: '5823' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Nondeterminism in the presence of a diverse or unknown future type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7966 year: '2013' ... --- _id: '2010' abstract: - lang: eng text: Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case. author: - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Garvesh full_name: Raskutti, Garvesh last_name: Raskutti - first_name: Peter full_name: Bühlmann, Peter last_name: Bühlmann - first_name: Bin full_name: Yu, Bin last_name: Yu citation: ama: Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 2013;41(2):436-463. doi:10.1214/12-AOS1080 apa: Uhler, C., Raskutti, G., Bühlmann, P., & Yu, B. (2013). Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/12-AOS1080 chicago: Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics. Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/12-AOS1080. ieee: C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness assumption in causal inference,” The Annals of Statistics, vol. 41, no. 2. Institute of Mathematical Statistics, pp. 436–463, 2013. ista: Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 41(2), 436–463. mla: Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics, vol. 41, no. 2, Institute of Mathematical Statistics, 2013, pp. 436–63, doi:10.1214/12-AOS1080. short: C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013) 436–463. date_created: 2018-12-11T11:55:11Z date_published: 2013-04-01T00:00:00Z date_updated: 2021-01-12T06:54:42Z day: '01' department: - _id: CaUh doi: 10.1214/12-AOS1080 external_id: arxiv: - '1207.0547' intvolume: ' 41' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: www.doi.org/10.1214/12-AOS1080 month: '04' oa: 1 oa_version: Published Version page: 436 - 463 publication: The Annals of Statistics publication_status: published publisher: Institute of Mathematical Statistics publist_id: '5066' quality_controlled: '1' scopus_import: 1 status: public title: Geometry of the faithfulness assumption in causal inference type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 41 year: '2013' ... --- _id: '2009' abstract: - lang: eng text: Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression. article_processing_charge: No author: - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Aleksandra full_name: Slavkovic, Aleksandra last_name: Slavkovic - first_name: Stephen full_name: Fienberg, Stephen last_name: Fienberg citation: ama: Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 2013;5(1):137-166. doi:10.29012/jpc.v5i1.629 apa: Uhler, C., Slavkovic, A., & Fienberg, S. (2013). Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . Carnegie Mellon University. https://doi.org/10.29012/jpc.v5i1.629 chicago: Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality . Carnegie Mellon University, 2013. https://doi.org/10.29012/jpc.v5i1.629. ieee: C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing for genome-wide association studies,” Journal of Privacy and Confidentiality , vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013. ista: Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 5(1), 137–166. mla: Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality , vol. 5, no. 1, Carnegie Mellon University, 2013, pp. 137–66, doi:10.29012/jpc.v5i1.629. short: C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality 5 (2013) 137–166. date_created: 2018-12-11T11:55:11Z date_published: 2013-08-01T00:00:00Z date_updated: 2021-01-12T06:54:41Z day: '01' department: - _id: CaUh doi: 10.29012/jpc.v5i1.629 intvolume: ' 5' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://repository.cmu.edu/jpc/vol5/iss1/6 month: '08' oa: 1 oa_version: Published Version page: 137 - 166 publication: 'Journal of Privacy and Confidentiality ' publication_status: published publisher: Carnegie Mellon University publist_id: '5067' quality_controlled: '1' status: public title: Privacy-preserving data sharing for genome-wide association studies type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 5 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: '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 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: '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: '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: '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: '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: '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: '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' ...