--- _id: '3120' abstract: - lang: eng text: We introduce a strategy based on Kustin-Miller unprojection that allows us to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions (that is, nine equations and sixteen first syzygies). Our two basic games are called Tom and Jerry; the main application is the biregular construction of most of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type I projection. In every case, at least one Tom and one Jerry construction works, providing at least two deformation families of quasismooth Fano 3-folds having the same numerics but different topology. © 2012 Copyright Foundation Compositio Mathematica. acknowledgement: This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0. author: - first_name: Gavin full_name: Brown, Gavin last_name: Brown - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Miles full_name: Reid, Miles last_name: Reid citation: ama: Brown G, Kerber M, Reid M. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 2012;148(4):1171-1194. doi:10.1112/S0010437X11007226 apa: Brown, G., Kerber, M., & Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. Cambridge University Press. https://doi.org/10.1112/S0010437X11007226 chicago: Brown, Gavin, Michael Kerber, and Miles Reid. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” Compositio Mathematica. Cambridge University Press, 2012. https://doi.org/10.1112/S0010437X11007226. ieee: G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” Compositio Mathematica, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012. ista: Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194. mla: Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” Compositio Mathematica, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:10.1112/S0010437X11007226. short: G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194. date_created: 2018-12-11T12:01:30Z date_published: 2012-07-01T00:00:00Z date_updated: 2021-01-12T07:41:12Z day: '01' department: - _id: HeEd doi: 10.1112/S0010437X11007226 intvolume: ' 148' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1009.4313 month: '07' oa: 1 oa_version: Preprint page: 1171 - 1194 publication: Compositio Mathematica publication_status: published publisher: Cambridge University Press publist_id: '3579' quality_controlled: '1' scopus_import: 1 status: public title: Fano 3 folds in codimension 4 Tom and Jerry Part I type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 148 year: '2012' ... --- _id: '3117' abstract: - lang: eng text: We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a submodular flow (SF) problem in an auxiliary graph in such a way that applying most existing SF algorithms would rely only on these subroutines. We then explore in more detail Iwata's capacity scaling approach for submodular flows (Iwata 1997 [19]). In particular, we show how to improve its complexity in the case when the function contains cardinality-dependent terms. author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: Kolmogorov V. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 2012;160(15):2246-2258. doi:10.1016/j.dam.2012.05.025 apa: Kolmogorov, V. (2012). Minimizing a sum of submodular functions. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2012.05.025 chicago: Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2012.05.025. ieee: V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012. ista: Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258. mla: Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025. short: V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258. date_created: 2018-12-11T12:01:29Z date_published: 2012-10-01T00:00:00Z date_updated: 2021-01-12T07:41:11Z day: '01' department: - _id: VlKo doi: 10.1016/j.dam.2012.05.025 intvolume: ' 160' issue: '15' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1006.1990 month: '10' oa: 1 oa_version: Preprint page: 2246 - 2258 publication: Discrete Applied Mathematics publication_status: published publisher: Elsevier publist_id: '3582' quality_controlled: '1' scopus_import: 1 status: public title: Minimizing a sum of submodular functions type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 160 year: '2012' ... --- _id: '3131' abstract: - lang: eng text: 'In large populations, many beneficial mutations may be simultaneously available and may compete with one another, slowing adaptation. By finding the probability of fixation of a favorable allele in a simple model of a haploid sexual population, we find limits to the rate of adaptive substitution, Λ, that depend on simple parameter combinations. When variance in fitness is low and linkage is loose, the baseline rate of substitution is Λ 0=2NU〈s〉 is the population size, U is the rate of beneficial mutations per genome, and 〈s〉 is their mean selective advantage. Heritable variance ν in log fitness due to unlinked loci reduces Λ by e -4ν under polygamy and e -8ν under monogamy. With a linear genetic map of length R Morgans, interference is yet stronger. We use a scaling argument to show that the density of adaptive substitutions depends on s, N, U, and R only through the baseline density: Λ/R=F(Λ 0/R). Under the approximation that the interference due to different sweeps adds up, we show that Λ/R~(Λ 0/R)/(1+2Λ 0/R), implying that interference prevents the rate of adaptive substitution from exceeding one per centimorgan per 200 generations. Simulations and numerical calculations confirm the scaling argument and confirm the additive approximation for Λ 0/R 1; for higher Λ 0/R, the rate of adaptation grows above R/2, but only very slowly. We also consider the effect of sweeps on neutral diversity and show that, while even occasional sweeps can greatly reduce neutral diversity, this effect saturates as sweeps become more common-diversity can be maintained even in populations experiencing very strong interference. Our results indicate that for some organisms the rate of adaptive substitution may be primarily recombination-limited, depending only weakly on the mutation supply and the strength of selection.' acknowledgement: "The work was funded by ERC grant 250152.\r\nWe thank B. Charlesworth, O. Hallatschek, W. G. Hill, R. A. Neher, S. P. Otto, and the anonymous reviewers for their helpful suggestions." article_number: e1002740 author: - first_name: Daniel full_name: Weissman, Daniel id: 2D0CE020-F248-11E8-B48F-1D18A9856A87 last_name: Weissman - 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: Weissman D, Barton NH. Limits to the rate of adaptive substitution in sexual populations. PLoS Genetics. 2012;8(6). doi:10.1371/journal.pgen.1002740 apa: Weissman, D., & Barton, N. H. (2012). Limits to the rate of adaptive substitution in sexual populations. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1002740 chicago: Weissman, Daniel, and Nicholas H Barton. “Limits to the Rate of Adaptive Substitution in Sexual Populations.” PLoS Genetics. Public Library of Science, 2012. https://doi.org/10.1371/journal.pgen.1002740. ieee: D. Weissman and N. H. Barton, “Limits to the rate of adaptive substitution in sexual populations,” PLoS Genetics, vol. 8, no. 6. Public Library of Science, 2012. ista: Weissman D, Barton NH. 2012. Limits to the rate of adaptive substitution in sexual populations. PLoS Genetics. 8(6), e1002740. mla: Weissman, Daniel, and Nicholas H. Barton. “Limits to the Rate of Adaptive Substitution in Sexual Populations.” PLoS Genetics, vol. 8, no. 6, e1002740, Public Library of Science, 2012, doi:10.1371/journal.pgen.1002740. short: D. Weissman, N.H. Barton, PLoS Genetics 8 (2012). date_created: 2018-12-11T12:01:34Z date_published: 2012-06-07T00:00:00Z date_updated: 2021-01-12T07:41:17Z day: '07' ddc: - '570' - '576' department: - _id: NiBa doi: 10.1371/journal.pgen.1002740 ec_funded: 1 file: - access_level: open_access checksum: 729a4becda7d786c4c3db8f9a1f77953 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:00Z date_updated: 2020-07-14T12:46:01Z file_id: '4659' file_name: IST-2013-114-v1+1_WeissmanBarton2012.pdf file_size: 1284801 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 8' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: PLoS Genetics publication_status: published publisher: Public Library of Science publist_id: '3566' pubrep_id: '114' quality_controlled: '1' scopus_import: 1 status: public title: Limits to the rate of adaptive substitution in sexual populations 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2012' ... --- _id: '3130' abstract: - lang: eng text: 'Essential genes code for fundamental cellular functions required for the viability of an organism. For this reason, essential genes are often highly conserved across organisms. However, this is not always the case: orthologues of genes that are essential in one organism are sometimes not essential in other organisms or are absent from their genomes. This suggests that, in the course of evolution, essential genes can be rendered nonessential. How can a gene become non-essential? Here we used genetic manipulation to deplete the products of 26 different essential genes in Escherichia coli. This depletion results in a lethal phenotype, which could often be rescued by the overexpression of a non-homologous, non-essential gene, most likely through replacement of the essential function. We also show that, in a smaller number of cases, the essential genes can be fully deleted from the genome, suggesting that complete functional replacement is possible. Finally, we show that essential genes whose function can be replaced in the laboratory are more likely to be non-essential or not present in other taxa. These results are consistent with the notion that patterns of evolutionary conservation of essential genes are influenced by their compensability-that is, by how easily they can be functionally replaced, for example through increased expression of other genes.' acknowledgement: We thank Alex Boehm for discussions and comments. article_number: e1002803 author: - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Martin full_name: Ackermann, Martin last_name: Ackermann - first_name: Olin full_name: Silander, Olin last_name: Silander citation: ama: Bergmiller T, Ackermann M, Silander O. Patterns of evolutionary conservation of essential genes correlate with their compensability. PLoS Genetics. 2012;8(6). doi:10.1371/journal.pgen.1002803 apa: Bergmiller, T., Ackermann, M., & Silander, O. (2012). Patterns of evolutionary conservation of essential genes correlate with their compensability. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1002803 chicago: Bergmiller, Tobias, Martin Ackermann, and Olin Silander. “Patterns of Evolutionary Conservation of Essential Genes Correlate with Their Compensability.” PLoS Genetics. Public Library of Science, 2012. https://doi.org/10.1371/journal.pgen.1002803. ieee: T. Bergmiller, M. Ackermann, and O. Silander, “Patterns of evolutionary conservation of essential genes correlate with their compensability,” PLoS Genetics, vol. 8, no. 6. Public Library of Science, 2012. ista: Bergmiller T, Ackermann M, Silander O. 2012. Patterns of evolutionary conservation of essential genes correlate with their compensability. PLoS Genetics. 8(6), e1002803. mla: Bergmiller, Tobias, et al. “Patterns of Evolutionary Conservation of Essential Genes Correlate with Their Compensability.” PLoS Genetics, vol. 8, no. 6, e1002803, Public Library of Science, 2012, doi:10.1371/journal.pgen.1002803. short: T. Bergmiller, M. Ackermann, O. Silander, PLoS Genetics 8 (2012). date_created: 2018-12-11T12:01:34Z date_published: 2012-06-28T00:00:00Z date_updated: 2021-01-12T07:41:16Z day: '28' ddc: - '576' department: - _id: CaGu doi: 10.1371/journal.pgen.1002803 file: - access_level: open_access checksum: f8506fb579eda6fc5613ba9bf421b86a content_type: application/pdf creator: system date_created: 2018-12-12T10:12:52Z date_updated: 2020-07-14T12:46:01Z file_id: '4973' file_name: IST-2015-386-v1+1_journal.pgen.1002803.pdf file_size: 2674138 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 8' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: PLoS Genetics publication_status: published publisher: Public Library of Science publist_id: '3567' pubrep_id: '386' quality_controlled: '1' scopus_import: 1 status: public title: Patterns of evolutionary conservation of essential genes correlate with their compensability 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2012' ... --- _id: '3136' abstract: - lang: eng text: 'Continuous-time Markov chains (CTMC) with their rich theory and efficient simulation algorithms have been successfully used in modeling stochastic processes in diverse areas such as computer science, physics, and biology. However, systems that comprise non-instantaneous events cannot be accurately and efficiently modeled with CTMCs. In this paper we define delayed CTMCs, an extension of CTMCs that allows for the specification of a lower bound on the time interval between an event''s initiation and its completion, and we propose an algorithm for the computation of their behavior. Our algorithm effectively decomposes the computation into two stages: a pure CTMC governs event initiations while a deterministic process guarantees lower bounds on event completion times. Furthermore, from the nature of delayed CTMCs, we obtain a parallelized version of our algorithm. We use our formalism to model genetic regulatory circuits (biological systems where delayed events are common) and report on the results of our numerical algorithm as run on a cluster. We compare performance and accuracy of our results with results obtained by using pure CTMCs. © 2012 Springer-Verlag.' acknowledgement: This work was supported by the ERC Advanced Investigator grant on Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation. alternative_title: - LNCS author: - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Maria full_name: Mateescu, Maria id: 3B43276C-F248-11E8-B48F-1D18A9856A87 last_name: Mateescu - first_name: Ali full_name: Sezgin, Ali id: 4C7638DA-F248-11E8-B48F-1D18A9856A87 last_name: Sezgin citation: ama: 'Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. Delayed continuous time Markov chains for genetic regulatory circuits. In: Vol 7358. Springer; 2012:294-309. doi:10.1007/978-3-642-31424-7_24' apa: 'Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., & Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_24' chicago: Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,” 7358:294–309. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_24. ieee: 'C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.' ista: 'Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.' mla: Guet, Calin C., et al. Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits. Vol. 7358, Springer, 2012, pp. 294–309, doi:10.1007/978-3-642-31424-7_24. short: C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309. conference: end_date: 2012-07-13 location: Berkeley, CA, USA name: 'CAV: Computer Aided Verification' start_date: 2012-07-07 date_created: 2018-12-11T12:01:36Z date_published: 2012-07-01T00:00:00Z date_updated: 2021-01-12T07:41:18Z day: '01' department: - _id: CaGu - _id: ToHe doi: 10.1007/978-3-642-31424-7_24 ec_funded: 1 language: - iso: eng month: '07' oa_version: None page: 294 - 309 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '3561' quality_controlled: '1' scopus_import: 1 status: public title: Delayed continuous time Markov chains for genetic regulatory circuits type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: '7358 ' year: '2012' ... --- _id: '3135' abstract: - lang: eng text: 'We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or ω. The ω updates model the reloading of a given resource. Each vertex belongs either to player □ or player ◇, where the aim of player □ is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, and show that although these problems are computationally hard in general, they are solvable in polynomial time for every fixed number of resource types (i.e., the dimension of the update vectors) and bounded resource updates. ' acknowledgement: 'Tomas Brazdil, Antonin Kucera, and Petr Novotny are supported by the Czech Science Foundation, grant No. P202/10/1469. Krishnendu Chatterjee is supported by the FWF (Austrian Science Fund) NFN Grant No S11407-N23 (RiSE) and ERC Start grant (279307: Graph Games).' alternative_title: - LNCS author: - first_name: Brázdil full_name: Brázdil, Brázdil last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny citation: ama: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. Efficient controller synthesis for consumption games with multiple resource types. In: Vol 7358. Springer; 2012:23-38. doi:10.1007/978-3-642-31424-7_8' apa: 'Brázdil, B., Chatterjee, K., Kučera, A., & Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8' chicago: Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,” 7358:23–38. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_8. ieee: 'B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.' ista: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.' mla: Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38, doi:10.1007/978-3-642-31424-7_8. short: B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp. 23–38. conference: end_date: 2012-07-13 location: Berkeley, CA, USA name: 'CAV: Computer Aided Verification' start_date: 2012-07-07 date_created: 2018-12-11T12:01:35Z date_published: 2012-07-01T00:00:00Z date_updated: 2021-01-12T07:41:18Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-31424-7_8 ec_funded: 1 intvolume: ' 7358' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1202.0796 month: '07' oa: 1 oa_version: Preprint page: 23 - 38 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3562' quality_controlled: '1' scopus_import: 1 status: public title: Efficient controller synthesis for consumption games with multiple resource types type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7358 year: '2012' ... --- _id: '3133' abstract: - lang: eng text: 'This note contributes to the point calculus of persistent homology by extending Alexander duality from spaces to real-valued functions. Given a perfect Morse function f: S n+1 →[0, 1 and a decomposition S n+1 = U ∪ V into two (n + 1)-manifolds with common boundary M, we prove elementary relationships between the persistence diagrams of f restricted to U, to V, and to M. ' acknowledgement: "his research is partially supported by the National Science Foundation (NSF) under grant DBI-0820624, the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.\r\nThe authors thank an anonymous referee for suggesting the simplified proof of the Contravariant PE Theorem given in this paper. They also thank Frederick Cohen, Yuriy Mileyko and Amit Patel for helpful discussions." author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: 'Edelsbrunner H, Kerber M. Alexander duality for functions: The persistent behavior of land and water and shore. In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry . ACM; 2012:249-258. doi:10.1145/2261250.2261287' apa: 'Edelsbrunner, H., & Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In Proceedings of the twenty-eighth annual symposium on Computational geometry (pp. 249–258). Chapel Hill, NC, USA: ACM. https://doi.org/10.1145/2261250.2261287' chicago: 'Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 249–58. ACM, 2012. https://doi.org/10.1145/2261250.2261287.' ieee: 'H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 249–258.' ista: 'Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.' mla: 'Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi:10.1145/2261250.2261287.' short: H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258. conference: end_date: 2012-06-20 location: Chapel Hill, NC, USA name: 'SCG: Symposium on Computational Geometry' start_date: 2012-06-17 date_created: 2018-12-11T12:01:35Z date_published: 2012-06-20T00:00:00Z date_updated: 2021-01-12T07:41:17Z day: '20' department: - _id: HeEd doi: 10.1145/2261250.2261287 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1109.5052 month: '06' oa: 1 oa_version: Preprint page: 249 - 258 publication: 'Proceedings of the twenty-eighth annual symposium on Computational geometry ' publication_status: published publisher: ACM publist_id: '3564' quality_controlled: '1' scopus_import: 1 status: public title: 'Alexander duality for functions: The persistent behavior of land and water and shore' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '3134' abstract: - lang: eng text: 'It has been an open question whether the sum of finitely many isotropic Gaussian kernels in n ≥ 2 dimensions can have more modes than kernels, until in 2003 Carreira-Perpiñán and Williams exhibited n +1 isotropic Gaussian kernels in ℝ n with n + 2 modes. We give a detailed analysis of this example, showing that it has exponentially many critical points and that the resilience of the extra mode grows like √n. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes. ' acknowledgement: This research is partially supported by the National Science Foun- dation (NSF) under grant DBI-0820624, by the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053. author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Brittany full_name: Fasy, Brittany last_name: Fasy - first_name: Günter full_name: Rote, Günter last_name: Rote citation: ama: 'Edelsbrunner H, Fasy B, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry . ACM; 2012:91-100. doi:10.1145/2261250.2261265' apa: 'Edelsbrunner, H., Fasy, B., & Rote, G. (2012). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In Proceedings of the twenty-eighth annual symposium on Computational geometry (pp. 91–100). Chapel Hill, NC, USA: ACM. https://doi.org/10.1145/2261250.2261265' chicago: 'Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 91–100. ACM, 2012. https://doi.org/10.1145/2261250.2261265.' ieee: 'H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 91–100.' ista: 'Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 91–100.' mla: 'Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100, doi:10.1145/2261250.2261265.' short: H. Edelsbrunner, B. Fasy, G. Rote, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100. conference: end_date: 2012-06-20 location: Chapel Hill, NC, USA name: 'SCG: Symposium on Computational Geometry' start_date: 2012-06-17 date_created: 2018-12-11T12:01:35Z date_published: 2012-06-20T00:00:00Z date_updated: 2023-02-23T10:59:27Z day: '20' department: - _id: HeEd doi: 10.1145/2261250.2261265 language: - iso: eng month: '06' oa_version: None page: 91 - 100 publication: 'Proceedings of the twenty-eighth annual symposium on Computational geometry ' publication_status: published publisher: ACM publist_id: '3563' quality_controlled: '1' related_material: record: - id: '2815' relation: later_version status: public scopus_import: 1 status: public title: 'Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '3132' abstract: - lang: eng text: 'Reproductive division of labour is a characteristic trait of social insects. The dominant reproductive individual, often the queen, uses chemical communication and/or behaviour to maintain her social status. Queens of many social insects communicate their fertility status via cuticle-bound substances. As these substances usually possess a low volatility, their range in queen–worker communication is potentially limited. Here, we investigate the range and impact of behavioural and chemical queen signals on workers of the ant Temnothorax longispinosus. We compared the behaviour and ovary development of workers subjected to three different treatments: workers with direct chemical and physical contact to the queen, those solely under the influence of volatile queen substances and those entirely separated from the queen. In addition to short-ranged queen signals preventing ovary development in workers, we discovered a novel secondary pathway influencing worker behaviour. Workers with no physical contact to the queen, but exposed to volatile substances, started to develop their ovaries, but did not change their behaviour compared to workers in direct contact to the queen. In contrast, workers in queen-separated groups showed both increased ovary development and aggressive dominance interactions. We conclude that T. longispinosus queens influence worker ovary development and behaviour via two independent signals, both ensuring social harmony within the colony.' acknowledgement: We like to thank the editor and three anonymous reviewers for their time and constructive criticism and Inon Scharf, Volker Witte and Andreas Modlmeier for helpful comments on earlier versions of the manuscript. The first and second authors appear in alphabetical order and contributed equally to this paper. author: - first_name: Matthias full_name: Konrad, Matthias id: 46528076-F248-11E8-B48F-1D18A9856A87 last_name: Konrad - first_name: Tobias full_name: Pamminger, Tobias last_name: Pamminger - first_name: Susanne full_name: Foitzik, Susanne last_name: Foitzik citation: ama: Konrad M, Pamminger T, Foitzik S. Two pathways ensuring social harmony. Naturwissenschaften. 2012;99(8):627-636. doi:10.1007/s00114-012-0943-z apa: Konrad, M., Pamminger, T., & Foitzik, S. (2012). Two pathways ensuring social harmony. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-012-0943-z chicago: Konrad, Matthias, Tobias Pamminger, and Susanne Foitzik. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften. Springer, 2012. https://doi.org/10.1007/s00114-012-0943-z. ieee: M. Konrad, T. Pamminger, and S. Foitzik, “Two pathways ensuring social harmony,” Naturwissenschaften, vol. 99, no. 8. Springer, pp. 627–636, 2012. ista: Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony. Naturwissenschaften. 99(8), 627–636. mla: Konrad, Matthias, et al. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften, vol. 99, no. 8, Springer, 2012, pp. 627–36, doi:10.1007/s00114-012-0943-z. short: M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636. date_created: 2018-12-11T12:01:34Z date_published: 2012-08-01T00:00:00Z date_updated: 2021-01-12T07:41:17Z day: '01' department: - _id: SyCr doi: 10.1007/s00114-012-0943-z intvolume: ' 99' issue: '8' language: - iso: eng month: '08' oa_version: None page: 627 - 636 publication: Naturwissenschaften publication_status: published publisher: Springer publist_id: '3565' quality_controlled: '1' scopus_import: 1 status: public title: Two pathways ensuring social harmony type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 99 year: '2012' ... --- _id: '3161' abstract: - lang: eng text: 'Some inflammatory stimuli trigger activation of the NLRP3 inflammasome by inducing efflux of cellular potassium. Loss of cellular potassium is known to potently suppress protein synthesis, leading us to test whether the inhibition of protein synthesis itself serves as an activating signal for the NLRP3 inflammasome. Murine bone marrow-derived macrophages, either primed by LPS or unprimed, were exposed to a panel of inhibitors of ribosomal function: ricin, cycloheximide, puromycin, pactamycin, and anisomycin. Macrophages were also exposed to nigericin, ATP, monosodium urate (MSU), and poly I:C. Synthesis of pro-IL-ß and release of IL-1ß from cells in response to these agents was detected by immunoblotting and ELISA. Release of intracellular potassium was measured by mass spectrometry. Inhibition of translation by each of the tested translation inhibitors led to processing of IL-1ß, which was released from cells. Processing and release of IL-1ß was reduced or absent from cells deficient in NLRP3, ASC, or caspase-1, demonstrating the role of the NLRP3 inflammasome. Despite the inability of these inhibitors to trigger efflux of intracellular potassium, the addition of high extracellular potassium suppressed activation of the NLRP3 inflammasome. MSU and double-stranded RNA, which are known to activate the NLRP3 inflammasome, also substantially inhibited protein translation, supporting a close association between inhibition of translation and inflammasome activation. These data demonstrate that translational inhibition itself constitutes a heretofore-unrecognized mechanism underlying IL-1ß dependent inflammatory signaling and that other physical, chemical, or pathogen-associated agents that impair translation may lead to IL-1ß-dependent inflammation through activation of the NLRP3 inflammasome. For agents that inhibit translation through decreased cellular potassium, the application of high extracellular potassium restores protein translation and suppresses activation of the NLRP inflammasome. For agents that inhibit translation through mechanisms that do not involve loss of potassium, high extracellular potassium suppresses IL-1ß processing through a mechanism that remains undefined.' acknowledgement: "Supported by National Institutes of Health grants GM071338 (ML) and AI059355 (BM).\r\nWe acknowledge the expertise of Dr. Martina Ralle in Department of Biochemistry and Molecular Biology at OHSU for measurements of potassium using inductively coupled plasma mass spectrometry." article_number: e36044 author: - first_name: Meghan full_name: Vyleta, Meghan id: 418901AA-F248-11E8-B48F-1D18A9856A87 last_name: Vyleta - first_name: John full_name: Wong, John last_name: Wong - first_name: Bruce full_name: Magun, Bruce last_name: Magun citation: ama: Vyleta M, Wong J, Magun B. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 2012;7(5). doi:10.1371/journal.pone.0036044 apa: Vyleta, M., Wong, J., & Magun, B. (2012). Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036044 chicago: Vyleta, Meghan, John Wong, and Bruce Magun. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0036044. ieee: M. Vyleta, J. Wong, and B. Magun, “Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome,” PLoS One, vol. 7, no. 5. Public Library of Science, 2012. ista: Vyleta M, Wong J, Magun B. 2012. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 7(5), e36044. mla: Vyleta, Meghan, et al. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” PLoS One, vol. 7, no. 5, e36044, Public Library of Science, 2012, doi:10.1371/journal.pone.0036044. short: M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012). date_created: 2018-12-11T12:01:45Z date_published: 2012-05-14T00:00:00Z date_updated: 2021-01-12T07:41:29Z day: '14' ddc: - '610' department: - _id: SyCr doi: 10.1371/journal.pone.0036044 file: - access_level: open_access checksum: 30cef37e27eaa467f6571b3640282010 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:30Z date_updated: 2020-07-14T12:46:01Z file_id: '5082' file_name: IST-2012-97-v1+1_journal.pone.0036044.pdf file_size: 2984012 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 7' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '3526' pubrep_id: '97' quality_controlled: '1' scopus_import: 1 status: public title: Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2012' ... --- _id: '3162' abstract: - lang: eng text: Given a dense-time real-valued signal and a parameterized temporal logic formula with both magnitude and timing parameters, we compute the subset of the parameter space that renders the formula satisfied by the trace. We provide two preliminary implementations, one which follows the exact semantics and attempts to compute the validity domain by quantifier elimination in linear arithmetics and one which conducts adaptive search in the parameter space. alternative_title: - LNCS article_processing_charge: No author: - first_name: Eugene full_name: Asarin, Eugene last_name: Asarin - first_name: Alexandre full_name: Donzé, Alexandre last_name: Donzé - first_name: Oded full_name: Maler, Oded last_name: Maler - first_name: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic citation: ama: 'Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:10.1007/978-3-642-29860-8_12' apa: 'Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12' chicago: Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. https://doi.org/10.1007/978-3-642-29860-8_12. ieee: 'E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160.' ista: 'Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.' mla: Asarin, Eugene, et al. Parametric Identification of Temporal Properties. Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12. short: E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160. conference: end_date: 2011-09-30 location: San Francisco, CA, United States name: 'RV: Runtime Verification' start_date: 2011-09-27 date_created: 2018-12-11T12:01:45Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:41:29Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-29860-8_12 file: - access_level: open_access checksum: ba4a75287008fc64b8fbf78a7476ec32 content_type: application/pdf creator: dernst date_created: 2020-05-15T12:50:15Z date_updated: 2020-07-14T12:46:01Z file_id: '7862' file_name: 2012_RV_Asarin.pdf file_size: 374726 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 7186' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 147 - 160 publication_status: published publisher: Springer publist_id: '3525' quality_controlled: '1' scopus_import: 1 status: public title: Parametric identification of temporal properties type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7186 year: '2012' ... --- _id: '3160' abstract: - lang: eng text: There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation. author: - first_name: Periklis full_name: Pantazis, Periklis last_name: Pantazis - first_name: Tobias full_name: Bollenbach, Tobias id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87 last_name: Bollenbach orcid: 0000-0003-4398-476X citation: ama: Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 2012;11(11):2055-2058. doi:10.4161/cc.20118 apa: Pantazis, P., & Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. Taylor and Francis. https://doi.org/10.4161/cc.20118 chicago: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle. Taylor and Francis, 2012. https://doi.org/10.4161/cc.20118. ieee: P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” Cell Cycle, vol. 11, no. 11. Taylor and Francis, pp. 2055–2058, 2012. ista: Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058. mla: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle, vol. 11, no. 11, Taylor and Francis, 2012, pp. 2055–58, doi:10.4161/cc.20118. short: P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058. date_created: 2018-12-11T12:01:44Z date_published: 2012-06-01T00:00:00Z date_updated: 2021-01-12T07:41:28Z day: '01' department: - _id: ToBo doi: 10.4161/cc.20118 intvolume: ' 11' issue: '11' language: - iso: eng month: '06' oa_version: None page: 2055 - 2058 publication: Cell Cycle publication_status: published publisher: Taylor and Francis publist_id: '3531' quality_controlled: '1' scopus_import: 1 status: public title: Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2012' ... --- _id: '3164' abstract: - lang: eng text: Overview of the Special Issue on structured prediction and inference. author: - first_name: Matthew full_name: Blaschko, Matthew last_name: Blaschko - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Blaschko M, Lampert C. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 2012;99(3):257-258. doi:10.1007/s11263-012-0530-y' apa: 'Blaschko, M., & Lampert, C. (2012). Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. Springer. https://doi.org/10.1007/s11263-012-0530-y' chicago: 'Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” International Journal of Computer Vision. Springer, 2012. https://doi.org/10.1007/s11263-012-0530-y.' ieee: 'M. Blaschko and C. Lampert, “Guest editorial: Special issue on structured prediction and inference,” International Journal of Computer Vision, vol. 99, no. 3. Springer, pp. 257–258, 2012.' ista: 'Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 99(3), 257–258.' mla: 'Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” International Journal of Computer Vision, vol. 99, no. 3, Springer, 2012, pp. 257–58, doi:10.1007/s11263-012-0530-y.' short: M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012) 257–258. date_created: 2018-12-11T12:01:46Z date_published: 2012-09-01T00:00:00Z date_updated: 2021-01-12T07:41:30Z day: '01' department: - _id: ChLa doi: 10.1007/s11263-012-0530-y intvolume: ' 99' issue: '3' language: - iso: eng month: '09' oa_version: None page: 257 - 258 publication: International Journal of Computer Vision publication_status: published publisher: Springer publist_id: '3521' quality_controlled: '1' scopus_import: 1 status: public title: 'Guest editorial: Special issue on structured prediction and inference' type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 99 year: '2012' ... --- _id: '3166' abstract: - lang: eng text: 'There is evidence that the genetic code was established prior to the existence of proteins, when metabolism was powered by ribozymes. Also, early proto-organisms had to rely on simple anaerobic bioenergetic processes. In this work I propose that amino acid fermentation powered metabolism in the RNA world, and that this was facilitated by proto-adapters, the precursors of the tRNAs. Amino acids were used as carbon sources rather than as catalytic or structural elements. In modern bacteria, amino acid fermentation is known as the Stickland reaction. This pathway involves two amino acids: the first undergoes oxidative deamination, and the second acts as an electron acceptor through reductive deamination. This redox reaction results in two keto acids that are employed to synthesise ATP via substrate-level phosphorylation. The Stickland reaction is the basic bioenergetic pathway of some bacteria of the genus Clostridium. Two other facts support Stickland fermentation in the RNA world. First, several Stickland amino acid pairs are synthesised in abiotic amino acid synthesis. This suggests that amino acids that could be used as an energy substrate were freely available. Second, anticodons that have complementary sequences often correspond to amino acids that form Stickland pairs. The main hypothesis of this paper is that pairs of complementary proto-adapters were assigned to Stickland amino acids pairs. There are signatures of this hypothesis in the genetic code. Furthermore, it is argued that the proto-adapters formed double strands that brought amino acid pairs into proximity to facilitate their mutual redox reaction, structurally constraining the anticodon pairs that are assigned to these amino acid pairs. Significance tests which randomise the code are performed to study the extent of the variability of the energetic (ATP) yield. Random assignments can lead to a substantial yield of ATP and maintain enough variability, thus selection can act and refine the assignments into a proto-code that optimises the energetic yield. Monte Carlo simulations are performed to evaluate the establishment of these simple proto-codes, based on amino acid substitutions and codon swapping. In all cases, donor amino acids are assigned to anticodons composed of U+G, and have low redundancy (1-2 codons), whereas acceptor amino acids are assigned to the the remaining codons. These bioenergetic and structural constraints allow for a metabolic role for amino acids before their co-option as catalyst cofactors. Reviewers: this article was reviewed by Prof. William Martin, Prof. Eors Szathmary (nominated by Dr. Gaspar Jekely) and Dr. Adam Kun (nominated by Dr. Sandor Pongor)' acknowledgement: 'The author was supported by the ERC-2009-AdG Grant for project 250152 SELECTIONINFORMATION. ' article_number: '6' author: - first_name: Harold full_name: Vladar, Harold id: 2A181218-F248-11E8-B48F-1D18A9856A87 last_name: Vladar orcid: 0000-0002-5985-7653 citation: ama: de Vladar H. Amino acid fermentation at the origin of the genetic code. Biology Direct. 2012;7. doi:10.1186/1745-6150-7-6 apa: de Vladar, H. (2012). Amino acid fermentation at the origin of the genetic code. Biology Direct. BioMed Central. https://doi.org/10.1186/1745-6150-7-6 chicago: Vladar, Harold de. “Amino Acid Fermentation at the Origin of the Genetic Code.” Biology Direct. BioMed Central, 2012. https://doi.org/10.1186/1745-6150-7-6. ieee: H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” Biology Direct, vol. 7. BioMed Central, 2012. ista: de Vladar H. 2012. Amino acid fermentation at the origin of the genetic code. Biology Direct. 7, 6. mla: de Vladar, Harold. “Amino Acid Fermentation at the Origin of the Genetic Code.” Biology Direct, vol. 7, 6, BioMed Central, 2012, doi:10.1186/1745-6150-7-6. short: H. de Vladar, Biology Direct 7 (2012). date_created: 2018-12-11T12:01:46Z date_published: 2012-02-10T00:00:00Z date_updated: 2021-01-12T07:41:31Z day: '10' ddc: - '570' - '576' department: - _id: NiBa doi: 10.1186/1745-6150-7-6 ec_funded: 1 file: - access_level: open_access checksum: e511e401e239ef608a7fd79b21a06d78 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:44Z date_updated: 2020-07-14T12:46:02Z file_id: '5166' file_name: IST-2012-99-v1+1_1745-6150-7-6.pdf file_size: 4099536 relation: main_file file_date_updated: 2020-07-14T12:46:02Z has_accepted_license: '1' intvolume: ' 7' language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Biology Direct publication_status: published publisher: BioMed Central publist_id: '3518' pubrep_id: '99' quality_controlled: '1' status: public title: Amino acid fermentation at the origin of the genetic code 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2012' ... --- _id: '3167' article_type: letter_note author: - first_name: Michele full_name: Weber, Michele id: 3A3FC708-F248-11E8-B48F-1D18A9856A87 last_name: Weber citation: ama: Weber M. NextGen speaks 13 . Science. 2012;336(6077):32-34. doi:10.1126/science.336.6077.32 apa: Weber, M. (2012). NextGen speaks 13 . Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.336.6077.32 chicago: Weber, Michele. “NextGen Speaks 13 .” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.336.6077.32. ieee: M. Weber, “NextGen speaks 13 ,” Science, vol. 336, no. 6077. American Association for the Advancement of Science, pp. 32–34, 2012. ista: Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34. mla: Weber, Michele. “NextGen Speaks 13 .” Science, vol. 336, no. 6077, American Association for the Advancement of Science, 2012, pp. 32–34, doi:10.1126/science.336.6077.32. short: M. Weber, Science 336 (2012) 32–34. date_created: 2018-12-11T12:01:47Z date_published: 2012-04-06T00:00:00Z date_updated: 2021-01-12T07:41:32Z day: '06' department: - _id: MiSi doi: 10.1126/science.336.6077.32 external_id: pmid: - '22491839' intvolume: ' 336' issue: '6077' language: - iso: eng month: '04' oa_version: None page: 32-34 pmid: 1 popular_science: '1' publication: Science publication_status: published publisher: American Association for the Advancement of Science publist_id: '3516' status: public title: 'NextGen speaks 13 ' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 336 year: '2012' ... --- _id: '3241' abstract: - lang: eng text: 'We prove a negative result concerning error reduction by parallel repetition for computationally sound protocols, e.g., interactive arguments. Our main result is a complete and computationally sound eight round interactive argument for which k-fold parallel repetition does not reduce the error below a constant for any polynomial k. The starting point for our construction is the work of Bellare, Impagliazzo and Naor (FOCS''97). For any fixed k, they construct a four round protocol for which k-fold parallel repetition does not lower the soundness error. The communication complexity of this protocol is linear in k. By using universal arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an eight-round protocol whose complexity is basically independent of k. ' author: - first_name: Krzysztof Z full_name: Krzysztof Pietrzak id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Douglas full_name: Wikström, Douglas last_name: Wikström citation: ama: Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 2012;25(1):116-135. doi:10.1007/s00145-010-9090-x apa: Pietrzak, K. Z., & Wikström, D. (2012). Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-010-9090-x chicago: Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology. Springer, 2012. https://doi.org/10.1007/s00145-010-9090-x. ieee: K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” Journal of Cryptology, vol. 25, no. 1. Springer, pp. 116–135, 2012. ista: Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135. mla: Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:10.1007/s00145-010-9090-x. short: K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135. date_created: 2018-12-11T12:02:12Z date_published: 2012-11-01T00:00:00Z date_updated: 2021-01-12T07:42:03Z day: '01' doi: 10.1007/s00145-010-9090-x extern: 1 intvolume: ' 25' issue: '1' month: '11' page: 116 - 135 publication: Journal of Cryptology publication_status: published publisher: Springer publist_id: '3439' quality_controlled: 0 status: public title: Parallel repetition of computationally sound protocols revisited type: journal_article volume: 25 year: '2012' ... --- _id: '3252' abstract: - lang: eng text: 'We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents, the trusted third party (TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove that the satisfaction of the objectives of the agents and the TTP imply satisfaction of the protocol objectives. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail in synthesizing these protocols, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee synthesis is attack-free; no subset of participants can violate the objectives of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner (ASW) certified mail protocol that has known vulnerabilities is not a solution of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can generate correct protocols and automatically discover vulnerabilities. The solution to assume-guarantee synthesis can be computed efficiently as the secure equilibrium solution of three-player graph games. © 2012 Springer-Verlag.' acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his invaluable help and feedback." 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: Vishwanath full_name: Raman, Vishwanath last_name: Raman citation: ama: 'Chatterjee K, Raman V. Synthesizing protocols for digital contract signing. In: Vol 7148. Springer; 2012:152-168. doi:10.1007/978-3-642-27940-9_11' apa: 'Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11' chicago: Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11. ieee: 'K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.' ista: 'Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.' mla: Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11. short: K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168. conference: end_date: 2012-01-24 location: Philadelphia, PA, USA name: 'VMCAI: Verification, Model Checking and Abstract Interpretation' start_date: 2012-01-22 date_created: 2018-12-11T12:02:16Z date_published: 2012-01-20T00:00:00Z date_updated: 2021-01-12T07:42:08Z day: '20' department: - _id: KrCh doi: 10.1007/978-3-642-27940-9_11 ec_funded: 1 intvolume: ' 7148' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1004.2697 month: '01' oa: 1 oa_version: Preprint page: 152 - 168 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _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: '3405' quality_controlled: '1' scopus_import: 1 status: public title: Synthesizing protocols for digital contract signing type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7148 year: '2012' ... --- _id: '3255' abstract: - lang: eng text: In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments. acknowledgement: This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship. alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen citation: ama: 'Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:10.1007/978-3-642-25929-6_3' apa: 'Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3' chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. https://doi.org/10.1007/978-3-642-25929-6_3. ieee: 'K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.' ista: 'Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.' mla: Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer, 2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3. short: K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46. conference: end_date: 2011-10-16 location: Lednice, Czech Republic name: 'MEMICS: Mathematical and Engineering Methods in Computer Science' start_date: 2011-10-14 date_created: 2018-12-11T12:02:17Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:42:10Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-642-25929-6_3 file: - access_level: open_access checksum: eed2cc1e76b160418c977e76e8899a60 content_type: application/pdf creator: dernst date_created: 2020-05-15T12:53:12Z date_updated: 2020-07-14T12:46:05Z file_id: '7863' file_name: 2012_MEMICS_Chatterjee.pdf file_size: 114060 relation: main_file file_date_updated: 2020-07-14T12:46:05Z has_accepted_license: '1' intvolume: ' 7119' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 37 - 46 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: '3400' quality_controlled: '1' scopus_import: 1 status: public title: Games and Markov decision processes with mean payoff parity and energy parity objectives type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7119 year: '2012' ... --- _id: '3250' abstract: - lang: eng text: The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of "provably secure" cryptographic schemes like encryption or authentication protocols. Being provably secure means that the scheme comes with a proof showing that the existence of an efficient adversary against the scheme implies that the underlying hardness assumption is wrong. LPN based schemes are appealing for theoretical and practical reasons. On the theoretical side, LPN based schemes offer a very strong security guarantee. The LPN problem is equivalent to the problem of decoding random linear codes, a problem that has been extensively studied in the last half century. The fastest known algorithms run in exponential time and unlike most number-theoretic problems used in cryptography, the LPN problem does not succumb to known quantum algorithms. On the practical side, LPN based schemes are often extremely simple and efficient in terms of code-size as well as time and space requirements. This makes them prime candidates for light-weight devices like RFID tags, which are too weak to implement standard cryptographic primitives like the AES block-cipher. This talk will be a gentle introduction to provable security using simple LPN based schemes as examples. Starting from pseudorandom generators and symmetric key encryption, over secret-key authentication protocols, and, if time admits, touching on recent constructions of public-key identification, commitments and zero-knowledge proofs. alternative_title: - LNCS author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Cryptography from learning parity with noise. In: Vol 7147. Springer; 2012:99-114. doi:10.1007/978-3-642-27660-6_9' apa: 'Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-27660-6_9' chicago: Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,” 7147:99–114. Springer, 2012. https://doi.org/10.1007/978-3-642-27660-6_9. ieee: 'K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.' ista: 'Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147, 99–114.' mla: Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9. short: K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114. conference: end_date: 2012-01-27 location: Špindlerův Mlýn, Czech Republic name: 'SOFSEM: Current Trends in Theory and Practice of Computer Science' start_date: 2012-01-21 date_created: 2018-12-11T12:02:15Z date_published: 2012-02-19T00:00:00Z date_updated: 2021-01-12T07:42:07Z day: '19' department: - _id: KrPi doi: 10.1007/978-3-642-27660-6_9 intvolume: ' 7147' language: - iso: eng month: '02' oa_version: None page: 99 - 114 publication_status: published publisher: Springer publist_id: '3407' quality_controlled: '1' scopus_import: 1 status: public title: Cryptography from learning parity with noise type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7147 year: '2012' ... --- _id: '3256' abstract: - lang: eng text: We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n. acknowledgement: This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624. author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 2012;47(2):393-414. doi:10.1007/s00454-011-9382-4 apa: Edelsbrunner, H., & Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-011-9382-4 chicago: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-011-9382-4. ieee: H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” Discrete & Computational Geometry, vol. 47, no. 2. Springer, pp. 393–414, 2012. ista: Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414. mla: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4. short: H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012) 393–414. date_created: 2018-12-11T12:02:17Z date_published: 2012-03-01T00:00:00Z date_updated: 2021-01-12T07:42:10Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s00454-011-9382-4 file: - access_level: open_access checksum: 76486f3b2c9e7fd81342f3832ca387e7 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:15Z date_updated: 2020-07-14T12:46:05Z file_id: '4675' file_name: IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf file_size: 203636 relation: main_file file_date_updated: 2020-07-14T12:46:05Z has_accepted_license: '1' intvolume: ' 47' issue: '2' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 393 - 414 publication: Discrete & Computational Geometry publication_status: published publisher: Springer publist_id: '3398' pubrep_id: '543' quality_controlled: '1' scopus_import: 1 status: public title: Dual complexes of cubical subdivisions of ℝn type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2012' ...