[{"issue":"4","volume":148,"language":[{"iso":"eng"}],"publication_status":"published","month":"07","intvolume":" 148","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1009.4313"}],"oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:41:12Z","status":"public","type":"journal_article","_id":"3120","date_published":"2012-07-01T00:00:00Z","doi":"10.1112/S0010437X11007226","date_created":"2018-12-11T12:01:30Z","page":"1171 - 1194","day":"01","publication":"Compositio Mathematica","year":"2012","quality_controlled":"1","publisher":"Cambridge University Press","oa":1,"acknowledgement":"This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0.","title":"Fano 3 folds in codimension 4 Tom and Jerry Part I","author":[{"last_name":"Brown","full_name":"Brown, Gavin","first_name":"Gavin"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber"},{"full_name":"Reid, Miles","last_name":"Reid","first_name":"Miles"}],"publist_id":"3579","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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","short":"G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.","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.","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."}},{"status":"public","type":"journal_article","_id":"3117","department":[{"_id":"VlKo"}],"title":"Minimizing a sum of submodular functions","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"publist_id":"3582","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:41:11Z","citation":{"ieee":"V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.","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","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.","ista":"Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258.","chicago":"Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2012.05.025."},"intvolume":" 160","month":"10","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.1990"}],"scopus_import":1,"quality_controlled":"1","publisher":"Elsevier","oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"date_created":"2018-12-11T12:01:29Z","issue":"15","doi":"10.1016/j.dam.2012.05.025","date_published":"2012-10-01T00:00:00Z","volume":160,"page":"2246 - 2258","language":[{"iso":"eng"}],"publication":"Discrete Applied Mathematics","day":"01","year":"2012","publication_status":"published"},{"quality_controlled":"1","publisher":"Public Library of Science","oa":1,"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.","date_published":"2012-06-07T00:00:00Z","doi":"10.1371/journal.pgen.1002740","date_created":"2018-12-11T12:01:34Z","has_accepted_license":"1","year":"2012","day":"07","publication":"PLoS Genetics","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"e1002740","author":[{"last_name":"Weissman","full_name":"Weissman, Daniel","id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3566","title":"Limits to the rate of adaptive substitution in sexual populations","citation":{"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.","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).","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.","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"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"06","intvolume":" 8","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."}],"oa_version":"Published Version","issue":"6","volume":8,"ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"729a4becda7d786c4c3db8f9a1f77953","file_id":"4659","date_updated":"2020-07-14T12:46:01Z","file_size":1284801,"creator":"system","date_created":"2018-12-12T10:08:00Z","file_name":"IST-2013-114-v1+1_WeissmanBarton2012.pdf"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"114","_id":"3131","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:46:01Z","date_updated":"2021-01-12T07:41:17Z","ddc":["570","576"]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","short":"T. Bergmiller, M. Ackermann, O. Silander, PLoS Genetics 8 (2012).","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","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.","ista":"Bergmiller T, Ackermann M, Silander O. 2012. Patterns of evolutionary conservation of essential genes correlate with their compensability. PLoS Genetics. 8(6), e1002803.","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."},"title":"Patterns of evolutionary conservation of essential genes correlate with their compensability","publist_id":"3567","author":[{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"},{"last_name":"Ackermann","full_name":"Ackermann, Martin","first_name":"Martin"},{"first_name":"Olin","full_name":"Silander, Olin","last_name":"Silander"}],"article_number":"e1002803","day":"28","publication":"PLoS Genetics","has_accepted_license":"1","year":"2012","date_published":"2012-06-28T00:00:00Z","doi":"10.1371/journal.pgen.1002803","date_created":"2018-12-11T12:01:34Z","acknowledgement":"We thank Alex Boehm for discussions and comments.","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"ddc":["576"],"date_updated":"2021-01-12T07:41:16Z","file_date_updated":"2020-07-14T12:46:01Z","department":[{"_id":"CaGu"}],"_id":"3130","status":"public","pubrep_id":"386","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"f8506fb579eda6fc5613ba9bf421b86a","file_id":"4973","date_updated":"2020-07-14T12:46:01Z","file_size":2674138,"creator":"system","date_created":"2018-12-12T10:12:52Z","file_name":"IST-2015-386-v1+1_journal.pgen.1002803.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":8,"issue":"6","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"06","intvolume":" 8","scopus_import":1},{"citation":{"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.","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.","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.","short":"C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.","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","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"},"date_updated":"2021-01-12T07:41:18Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3561","author":[{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","full_name":"Mateescu, Maria","last_name":"Mateescu"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"}],"title":"Delayed continuous time Markov chains for genetic regulatory circuits","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"_id":"3136","conference":{"name":"CAV: Computer Aided Verification","location":"Berkeley, CA, USA","end_date":"2012-07-13","start_date":"2012-07-07"},"type":"conference","status":"public","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"year":"2012","publication_status":"published","language":[{"iso":"eng"}],"day":"01","page":"294 - 309","ec_funded":1,"date_created":"2018-12-11T12:01:36Z","doi":"10.1007/978-3-642-31424-7_24","volume":"7358 ","date_published":"2012-07-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation.","oa_version":"None","publisher":"Springer","alternative_title":["LNCS"],"scopus_import":1,"quality_controlled":"1","month":"07"},{"_id":"3135","status":"public","type":"conference","conference":{"name":"CAV: Computer Aided Verification","location":"Berkeley, CA, USA","end_date":"2012-07-13","start_date":"2012-07-07"},"date_updated":"2021-01-12T07:41:18Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","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. "}],"month":"07","intvolume":" 7358","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.0796"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":7358,"ec_funded":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","short":"B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp. 23–38.","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"},"title":"Efficient controller synthesis for consumption games with multiple resource types","publist_id":"3562","author":[{"last_name":"Brázdil","full_name":"Brázdil, Brázdil","first_name":"Brázdil"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"}],"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).","publisher":"Springer","quality_controlled":"1","oa":1,"day":"01","year":"2012","date_published":"2012-07-01T00:00:00Z","doi":"10.1007/978-3-642-31424-7_8","date_created":"2018-12-11T12:01:35Z","page":"23 - 38"},{"_id":"3133","type":"conference","conference":{"name":"SCG: Symposium on Computational Geometry","end_date":"2012-06-20","location":"Chapel Hill, NC, USA","start_date":"2012-06-17"},"status":"public","date_updated":"2021-01-12T07:41:17Z","citation":{"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.","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.","short":"H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258.","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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3564","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"title":"Alexander duality for functions: The persistent behavior of land and water and shore","department":[{"_id":"HeEd"}],"abstract":[{"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. ","lang":"eng"}],"oa_version":"Preprint","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.","quality_controlled":"1","scopus_import":1,"publisher":"ACM","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1109.5052","open_access":"1"}],"month":"06","year":"2012","publication_status":"published","day":"20","language":[{"iso":"eng"}],"publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry ","page":"249 - 258","date_published":"2012-06-20T00:00:00Z","doi":"10.1145/2261250.2261287","date_created":"2018-12-11T12:01:35Z"},{"type":"conference","conference":{"start_date":"2012-06-17","end_date":"2012-06-20","location":"Chapel Hill, NC, USA","name":"SCG: Symposium on Computational Geometry"},"status":"public","_id":"3134","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Brittany","last_name":"Fasy","full_name":"Fasy, Brittany"},{"full_name":"Rote, Günter","last_name":"Rote","first_name":"Günter"}],"publist_id":"3563","title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","department":[{"_id":"HeEd"}],"citation":{"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.","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.","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.","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."},"date_updated":"2023-02-23T10:59:27Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":1,"publisher":"ACM","month":"06","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. "}],"oa_version":"None","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.","page":"91 - 100","related_material":{"record":[{"id":"2815","status":"public","relation":"later_version"}]},"date_published":"2012-06-20T00:00:00Z","doi":"10.1145/2261250.2261265","date_created":"2018-12-11T12:01:35Z","publication_status":"published","year":"2012","day":"20","language":[{"iso":"eng"}],"publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry "},{"_id":"3132","type":"journal_article","status":"public","date_updated":"2021-01-12T07:41:17Z","citation":{"ista":"Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony. Naturwissenschaften. 99(8), 627–636.","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.","short":"M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636.","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","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Konrad","full_name":"Konrad, Matthias","first_name":"Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","last_name":"Pamminger","full_name":"Pamminger, Tobias"},{"last_name":"Foitzik","full_name":"Foitzik, Susanne","first_name":"Susanne"}],"publist_id":"3565","title":"Two pathways ensuring social harmony","department":[{"_id":"SyCr"}],"abstract":[{"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.","lang":"eng"}],"oa_version":"None","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.","quality_controlled":"1","scopus_import":1,"publisher":"Springer","month":"08","intvolume":" 99","publication_status":"published","year":"2012","day":"01","language":[{"iso":"eng"}],"publication":"Naturwissenschaften","page":"627 - 636","issue":"8","date_published":"2012-08-01T00:00:00Z","doi":"10.1007/s00114-012-0943-z","volume":99,"date_created":"2018-12-11T12:01:34Z"},{"pubrep_id":"97","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"3161","department":[{"_id":"SyCr"}],"file_date_updated":"2020-07-14T12:46:01Z","ddc":["610"],"date_updated":"2021-01-12T07:41:29Z","intvolume":" 7","month":"05","scopus_import":1,"oa_version":"Published Version","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."}],"issue":"5","volume":7,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5082","checksum":"30cef37e27eaa467f6571b3640282010","creator":"system","date_updated":"2020-07-14T12:46:01Z","file_size":2984012,"date_created":"2018-12-12T10:14:30Z","file_name":"IST-2012-97-v1+1_journal.pone.0036044.pdf"}],"publication_status":"published","article_number":"e36044","title":"Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome","author":[{"full_name":"Vyleta, Meghan","last_name":"Vyleta","first_name":"Meghan","id":"418901AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wong, John","last_name":"Wong","first_name":"John"},{"full_name":"Magun, Bruce","last_name":"Magun","first_name":"Bruce"}],"publist_id":"3526","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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","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.","short":"M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012).","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.","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."},"oa":1,"publisher":"Public Library of Science","quality_controlled":"1","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.","date_created":"2018-12-11T12:01:45Z","doi":"10.1371/journal.pone.0036044","date_published":"2012-05-14T00:00:00Z","publication":"PLoS One","day":"14","year":"2012","has_accepted_license":"1"},{"publisher":"Springer","quality_controlled":"1","oa":1,"page":"147 - 160","doi":"10.1007/978-3-642-29860-8_12","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T12:01:45Z","has_accepted_license":"1","year":"2012","day":"01","publist_id":"3525","author":[{"first_name":"Eugene","full_name":"Asarin, Eugene","last_name":"Asarin"},{"last_name":"Donzé","full_name":"Donzé, Alexandre","first_name":"Alexandre"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"article_processing_charge":"No","title":"Parametric identification of temporal properties","citation":{"short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.","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.","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","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.","ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"scopus_import":1,"month":"01","intvolume":" 7186","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."}],"oa_version":"Submitted Version","volume":7186,"publication_status":"published","file":[{"file_name":"2012_RV_Asarin.pdf","date_created":"2020-05-15T12:50:15Z","creator":"dernst","file_size":374726,"date_updated":"2020-07-14T12:46:01Z","file_id":"7862","checksum":"ba4a75287008fc64b8fbf78a7476ec32","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2011-09-27","location":"San Francisco, CA, United States","end_date":"2011-09-30","name":"RV: Runtime Verification"},"status":"public","_id":"3162","file_date_updated":"2020-07-14T12:46:01Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:41:29Z","ddc":["000"]},{"month":"06","intvolume":" 11","quality_controlled":"1","publisher":"Taylor and Francis","scopus_import":1,"oa_version":"None","abstract":[{"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.","lang":"eng"}],"doi":"10.4161/cc.20118","volume":11,"date_published":"2012-06-01T00:00:00Z","issue":"11","date_created":"2018-12-11T12:01:44Z","page":"2055 - 2058","day":"01","language":[{"iso":"eng"}],"publication":"Cell Cycle","publication_status":"published","year":"2012","status":"public","type":"journal_article","_id":"3160","title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo","department":[{"_id":"ToBo"}],"author":[{"first_name":"Periklis","last_name":"Pantazis","full_name":"Pantazis, Periklis"},{"full_name":"Bollenbach, Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"}],"publist_id":"3531","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058."},"date_updated":"2021-01-12T07:41:28Z"},{"publication":"International Journal of Computer Vision","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2012","date_created":"2018-12-11T12:01:46Z","issue":"3","doi":"10.1007/s11263-012-0530-y","date_published":"2012-09-01T00:00:00Z","volume":99,"page":"257 - 258","oa_version":"None","abstract":[{"text":"Overview of the Special Issue on structured prediction and inference.","lang":"eng"}],"intvolume":" 99","month":"09","publisher":"Springer","scopus_import":1,"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:41:30Z","citation":{"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","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","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.","short":"M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012) 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.","ista":"Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 99(3), 257–258.","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."},"title":"Guest editorial: Special issue on structured prediction and inference","department":[{"_id":"ChLa"}],"author":[{"first_name":"Matthew","full_name":"Blaschko, Matthew","last_name":"Blaschko"},{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"publist_id":"3521","_id":"3164","status":"public","type":"journal_article"},{"oa_version":"Published Version","abstract":[{"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)","lang":"eng"}],"month":"02","intvolume":" 7","file":[{"file_id":"5166","checksum":"e511e401e239ef608a7fd79b21a06d78","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2012-99-v1+1_1745-6150-7-6.pdf","date_created":"2018-12-12T10:15:44Z","file_size":4099536,"date_updated":"2020-07-14T12:46:02Z","creator":"system"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":7,"ec_funded":1,"_id":"3166","status":"public","pubrep_id":"99","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570","576"],"date_updated":"2021-01-12T07:41:31Z","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:46:02Z","acknowledgement":"The author was supported by the ERC-2009-AdG Grant for project 250152 SELECTIONINFORMATION. ","publisher":"BioMed Central","quality_controlled":"1","oa":1,"day":"10","publication":"Biology Direct","has_accepted_license":"1","year":"2012","doi":"10.1186/1745-6150-7-6","date_published":"2012-02-10T00:00:00Z","date_created":"2018-12-11T12:01:46Z","article_number":"6","project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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","ieee":"H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” Biology Direct, vol. 7. BioMed Central, 2012.","short":"H. de Vladar, Biology Direct 7 (2012)."},"title":"Amino acid fermentation at the origin of the genetic code","author":[{"last_name":"Vladar","full_name":"Vladar, Harold","orcid":"0000-0002-5985-7653","first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3518"},{"department":[{"_id":"MiSi"}],"title":"NextGen speaks 13 ","external_id":{"pmid":["22491839"]},"publist_id":"3516","author":[{"last_name":"Weber","full_name":"Weber, Michele","first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34.","chicago":"Weber, Michele. “NextGen Speaks 13 .” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.336.6077.32.","short":"M. Weber, Science 336 (2012) 32–34.","ieee":"M. Weber, “NextGen speaks 13 ,” Science, vol. 336, no. 6077. American Association for the Advancement of Science, pp. 32–34, 2012.","apa":"Weber, M. (2012). NextGen speaks 13 . Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.336.6077.32","ama":"Weber M. NextGen speaks 13 . Science. 2012;336(6077):32-34. doi:10.1126/science.336.6077.32","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."},"date_updated":"2021-01-12T07:41:32Z","status":"public","article_type":"letter_note","type":"journal_article","_id":"3167","date_created":"2018-12-11T12:01:47Z","date_published":"2012-04-06T00:00:00Z","volume":336,"issue":"6077","doi":"10.1126/science.336.6077.32","page":"32-34","publication":"Science","language":[{"iso":"eng"}],"day":"06","publication_status":"published","year":"2012","popular_science":"1","intvolume":" 336","month":"04","publisher":"American Association for the Advancement of Science","pmid":1,"oa_version":"None"},{"abstract":[{"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. ","lang":"eng"}],"publisher":"Springer","quality_controlled":0,"intvolume":" 25","month":"11","publication_status":"published","year":"2012","publication":"Journal of Cryptology","day":"01","page":"116 - 135","date_created":"2018-12-11T12:02:12Z","volume":25,"date_published":"2012-11-01T00:00:00Z","doi":"10.1007/s00145-010-9090-x","issue":"1","_id":"3241","type":"journal_article","status":"public","citation":{"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.","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.","short":"K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.","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","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","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.","ista":"Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135."},"date_updated":"2021-01-12T07:42:03Z","extern":1,"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","orcid":"0000-0002-9139-1654"},{"last_name":"Wikström","full_name":"Wikström, Douglas","first_name":"Douglas"}],"publist_id":"3439","title":"Parallel repetition of computationally sound protocols revisited"},{"_id":"3252","type":"conference","conference":{"start_date":"2012-01-22","end_date":"2012-01-24","location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"status":"public","date_updated":"2021-01-12T07:42:08Z","department":[{"_id":"KrCh"}],"abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1004.2697","open_access":"1"}],"month":"01","intvolume":" 7148","publication_status":"published","language":[{"iso":"eng"}],"volume":7148,"ec_funded":1,"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"short":"K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.","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.","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","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.","ista":"Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3405","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Vishwanath","full_name":"Raman, Vishwanath","last_name":"Raman"}],"title":"Synthesizing protocols for digital contract signing","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.","quality_controlled":"1","publisher":"Springer","oa":1,"year":"2012","day":"20","page":"152 - 168","date_published":"2012-01-20T00:00:00Z","doi":"10.1007/978-3-642-27940-9_11","date_created":"2018-12-11T12:02:16Z"},{"volume":7119,"publication_status":"published","file":[{"file_id":"7863","checksum":"eed2cc1e76b160418c977e76e8899a60","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-05-15T12:53:12Z","file_name":"2012_MEMICS_Chatterjee.pdf","date_updated":"2020-07-14T12:46:05Z","file_size":114060,"creator":"dernst"}],"language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"month":"01","intvolume":" 7119","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."}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:05Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:10Z","ddc":["000"],"type":"conference","conference":{"location":"Lednice, Czech Republic","end_date":"2011-10-16","start_date":"2011-10-14","name":"MEMICS: Mathematical and Engineering Methods in Computer Science"},"status":"public","_id":"3255","page":"37 - 46","date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-3-642-25929-6_3","date_created":"2018-12-11T12:02:17Z","has_accepted_license":"1","year":"2012","day":"01","quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"publist_id":"3400","article_processing_charge":"No","title":"Games and Markov decision processes with mean payoff parity and energy parity objectives","citation":{"short":"K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.","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.","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}]},{"_id":"3250","conference":{"location":"Špindlerův Mlýn, Czech Republic","end_date":"2012-01-27","start_date":"2012-01-21","name":"SOFSEM: Current Trends in Theory and Practice of Computer Science"},"type":"conference","status":"public","date_updated":"2021-01-12T07:42:07Z","citation":{"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.","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.","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.","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.","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","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"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"publist_id":"3407","department":[{"_id":"KrPi"}],"title":"Cryptography from learning parity with noise","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."}],"oa_version":"None","quality_controlled":"1","alternative_title":["LNCS"],"scopus_import":1,"publisher":"Springer","intvolume":" 7147","month":"02","publication_status":"published","year":"2012","language":[{"iso":"eng"}],"day":"19","page":"99 - 114","date_created":"2018-12-11T12:02:15Z","volume":7147,"date_published":"2012-02-19T00:00:00Z","doi":"10.1007/978-3-642-27660-6_9"},{"page":"393 - 414","doi":"10.1007/s00454-011-9382-4","date_published":"2012-03-01T00:00:00Z","date_created":"2018-12-11T12:02:17Z","has_accepted_license":"1","year":"2012","day":"01","publication":"Discrete & Computational Geometry","publisher":"Springer","quality_controlled":"1","oa":1,"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":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber"}],"publist_id":"3398","title":"Dual complexes of cubical subdivisions of ℝn","citation":{"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.","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.","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.","short":"H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012) 393–414.","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","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"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":47,"issue":"2","publication_status":"published","file":[{"file_name":"IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf","date_created":"2018-12-12T10:08:15Z","file_size":203636,"date_updated":"2020-07-14T12:46:05Z","creator":"system","file_id":"4675","checksum":"76486f3b2c9e7fd81342f3832ca387e7","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"03","intvolume":" 47","abstract":[{"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.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:05Z","date_updated":"2021-01-12T07:42:10Z","ddc":["000"],"type":"journal_article","status":"public","pubrep_id":"543","_id":"3256"},{"status":"public","type":"journal_article","_id":"3254","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:09Z","month":"02","intvolume":" 211","scopus_import":1,"main_file_link":[{"url":"http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf"}],"oa_version":"None","abstract":[{"lang":"eng","text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes."}],"volume":211,"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"The complexity of stochastic Müller games","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"publist_id":"3403","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211. Elsevier, pp. 29–48, 2012.","short":"K. Chatterjee, Information and Computation 211 (2012) 29–48.","apa":"Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004","ama":"Chatterjee K. The complexity of stochastic Müller games. Information and Computation. 2012;211:29-48. doi:10.1016/j.ic.2011.11.004","mla":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.","ista":"Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.","chicago":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004."},"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","date_published":"2012-02-01T00:00:00Z","doi":"10.1016/j.ic.2011.11.004","date_created":"2018-12-11T12:02:17Z","page":"29 - 48","day":"01","publication":"Information and Computation","year":"2012"},{"language":[{"iso":"eng"}],"day":"26","year":"2012","publication_status":"published","date_created":"2018-12-11T12:02:17Z","volume":7148,"date_published":"2012-02-26T00:00:00Z","doi":"10.1007/978-3-642-27940-9_1","page":"1 - 22","acknowledgement":"This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016).","oa_version":"None","abstract":[{"lang":"eng","text":"We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs."}],"intvolume":" 7148","month":"02","quality_controlled":"1","alternative_title":["LNCS"],"publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:09Z","citation":{"ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.","apa":"Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:10.1007/978-3-642-27940-9_1","mla":"Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012, pp. 1–22, doi:10.1007/978-3-642-27940-9_1.","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1."},"title":"Abstract domains for automated reasoning about list manipulating programs with infinite data","department":[{"_id":"ToHe"}],"author":[{"last_name":"Bouajjani","full_name":"Bouajjani, Ahmed","first_name":"Ahmed"},{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"first_name":"Constantin","full_name":"Enea, Constantin","last_name":"Enea"},{"last_name":"Sighireanu","full_name":"Sighireanu, Mihaela","first_name":"Mihaela"}],"publist_id":"3404","_id":"3253","status":"public","conference":{"start_date":"2012-01-22","end_date":"2012-01-24","location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"type":"conference"},{"article_number":"6126486","_id":"3265","status":"public","conference":{"name":"ICCV: International Conference on Computer Vision","location":"Barcelona, Spain","end_date":"2011-11-13","start_date":"2011-11-06"},"type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. https://doi.org/10.1109/ICCV.2011.6126486.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.","apa":"Ion, A., Carreira, J., & Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126486","ama":"Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:10.1109/ICCV.2011.6126486","mla":"Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486."},"date_updated":"2021-01-12T07:42:15Z","department":[{"_id":"HeEd"}],"title":"Image segmentation by figure-ground composition into maximal cliques","publist_id":"3382","author":[{"full_name":"Ion, Adrian","last_name":"Ion","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joao","last_name":"Carreira","full_name":"Carreira, Joao"},{"first_name":"Cristian","last_name":"Sminchisescu","full_name":"Sminchisescu, Cristian"}],"oa_version":"None","abstract":[{"lang":"eng","text":"We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and scales, into larger interpretations (tilings) of the entire image. Inference is cast as optimization over sets of maximal cliques sampled from a graph connecting all non-overlapping figure-ground segment hypotheses. Potential functions over cliques combine unary, Gestalt-based figure qualities, and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics of real scenes. Learning the model parameters is based on maximum likelihood, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where a 28% improvement was achieved."}],"month":"01","publisher":"IEEE","quality_controlled":"1","language":[{"iso":"eng"}],"day":"12","year":"2012","publication_status":"published","date_created":"2018-12-11T12:02:21Z","date_published":"2012-01-12T00:00:00Z","doi":"10.1109/ICCV.2011.6126486"},{"publist_id":"3364","author":[{"last_name":"Dodis","full_name":"Dodis, Yevgeniy","first_name":"Yevgeniy"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"last_name":"Wichs","full_name":"Wichs, Daniel","first_name":"Daniel"}],"title":"Message authentication, revisited","citation":{"ista":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237, 355–374.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. https://doi.org/10.1007/978-3-642-29011-4_22.","ama":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:10.1007/978-3-642-29011-4_22","apa":"Dodis, Y., Pietrzak, K. Z., Kiltz, E., & Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. https://doi.org/10.1007/978-3-642-29011-4_22","ieee":"Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.","short":"Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.","mla":"Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"page":"355 - 374","date_created":"2018-12-11T12:02:27Z","date_published":"2012-03-10T00:00:00Z","doi":"10.1007/978-3-642-29011-4_22","year":"2012","has_accepted_license":"1","day":"10","oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","file_date_updated":"2020-07-14T12:46:06Z","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T07:42:22Z","ddc":["000","004"],"conference":{"start_date":"2012-04-15","location":"Cambridge, UK","end_date":"2012-04-19","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","pubrep_id":"686","status":"public","_id":"3282","ec_funded":1,"volume":7237,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"8557c17a8c2586d06ebfe62d934f5c5f","file_id":"5074","creator":"system","file_size":372292,"date_updated":"2020-07-14T12:46:06Z","file_name":"IST-2016-686-v1+1_059.pdf","date_created":"2018-12-12T10:14:23Z"}],"alternative_title":["LNCS"],"intvolume":" 7237","month":"03","abstract":[{"lang":"eng","text":"Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is "message-hiding" into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt'11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research."}],"oa_version":"Submitted Version"},{"publist_id":"3366","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"title":"Subspace LWE","citation":{"mla":"Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31.","apa":"Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_31","ama":"Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:10.1007/978-3-642-28914-9_31","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.","ieee":"K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.","chicago":"Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_31.","ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"page":"548 - 563","date_created":"2018-12-11T12:02:26Z","date_published":"2012-05-04T00:00:00Z","doi":"10.1007/978-3-642-28914-9_31","year":"2012","day":"04","oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T07:42:21Z","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2012-03-19","end_date":"2012-03-21","location":"Taormina, Sicily, Italy"},"type":"conference","status":"public","_id":"3280","ec_funded":1,"volume":7194,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf","open_access":"1"}],"alternative_title":["LNCS"],"intvolume":" 7194","month":"05","abstract":[{"text":"The (decisional) learning with errors problem (LWE) asks to distinguish "noisy" inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called "subspace LWE" (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. ","lang":"eng"}],"oa_version":"Submitted Version"},{"status":"public","conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2012-03-21","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"type":"conference","_id":"3281","department":[{"_id":"KrPi"}],"title":"Lossy functions do not amplify well","publist_id":"3365","author":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rosen","full_name":"Rosen, Alon","first_name":"Alon"},{"first_name":"Gil","full_name":"Segev, Gil","last_name":"Segev"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.","short":"K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.","ieee":"K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.","apa":"Pietrzak, K. Z., Rosen, A., & Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_26","ama":"Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:10.1007/978-3-642-28914-9_26","chicago":"Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_26.","ista":"Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475."},"date_updated":"2021-01-12T07:42:22Z","intvolume":" 7194","month":"05","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"alternative_title":["LNCS"],"publisher":"Springer","quality_controlled":"1","acknowledgement":"We would like to thank Oded Goldreich and Omer Rein- gold for discussions at an early stage of this project, and Scott Aaronson for clarifications regarding the collision problem.\r\n","oa_version":"None","abstract":[{"lang":"eng","text":"We consider the problem of amplifying the "lossiness" of functions. We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f has image size at most 2 m-L. The question is whether such C* exists for L/m ≫ ℓ/n. This problem arises naturally in the context of cryptographic "lossy functions," where the relative lossiness is the key parameter. We show that for every circuit C* that makes at most t queries to f, the relative lossiness of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making a polynomial t = poly(n) number of queries can amplify relative lossiness by more than an O(logn)/n additive term. We show that this is tight by giving a simple construction (cascading with some randomization) that achieves such amplification."}],"date_created":"2018-12-11T12:02:26Z","volume":7194,"date_published":"2012-05-04T00:00:00Z","doi":"10.1007/978-3-642-28914-9_26","page":"458 - 475","language":[{"iso":"eng"}],"day":"04","year":"2012","publication_status":"published"},{"title":"The complexity of conservative valued CSPs","author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"Stanislav","last_name":"Živný","full_name":"Živný, Stanislav"}],"publist_id":"3362","extern":1,"citation":{"chicago":"Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012.","ista":"Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759.","mla":"Kolmogorov, Vladimir, and Stanislav Živný. The Complexity of Conservative Valued CSPs. SIAM, 2012, pp. 750–59.","short":"V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.","ieee":"V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.","apa":"Kolmogorov, V., & Živný, S. (2012). The complexity of conservative valued CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","ama":"Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759."},"date_updated":"2021-01-12T07:42:23Z","status":"public","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"_id":"3284","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T12:02:27Z","page":"750 - 759","day":"01","publication_status":"published","year":"2012","month":"01","publisher":"SIAM","quality_controlled":0,"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1008.1555","open_access":"1"}],"acknowledgement":"Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.","abstract":[{"lang":"eng","text":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.\nWe consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).\nWe prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].\nOur results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages."}]},{"intvolume":" 134","month":"01","quality_controlled":"1","publisher":"ACS","oa_version":"None","abstract":[{"lang":"eng","text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. "}],"date_created":"2018-12-11T11:45:51Z","doi":"10.1021/ja209688a","date_published":"2012-01-02T00:00:00Z","issue":"3","volume":134,"page":"1438 - 1441","language":[{"iso":"eng"}],"publication":"Journal of the American Chemical Society","day":"02","year":"2012","publication_status":"published","status":"public","type":"journal_article","article_type":"original","_id":"330","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","article_processing_charge":"No","author":[{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alex","last_name":"Carrete","full_name":"Carrete, Alex"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"publist_id":"7531","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:42:29Z","citation":{"ama":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 2012;134(3):1438-1441. doi:10.1021/ja209688a","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., & Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja209688a","ieee":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” Journal of the American Chemical Society, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:10.1021/ja209688a.","ista":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 134(3), 1438–1441.","chicago":"Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja209688a."}},{"project":[{"_id":"25BC64A8-B435-11E9-9278-68D0E5697425","name":"Synaptic Mechanisms of Neuronal Network Function","grant_number":"JO_780/A5"},{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21.","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nrn3125.","ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 2012;13(1):7-21. doi:10.1038/nrn3125","apa":"Eggermann, E., Bucurenciu, I., Goswami, S., & Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nrn3125","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21.","ieee":"E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” Nature Reviews Neuroscience, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:10.1038/nrn3125."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3322","author":[{"full_name":"Eggermann, Emmanuel","last_name":"Eggermann","first_name":"Emmanuel","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C"},{"id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A","first_name":"Iancu","full_name":"Bucurenciu, Iancu","last_name":"Bucurenciu"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","last_name":"Goswami","full_name":"Goswami, Sarit"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","acknowledgement":"Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2012","day":"01","publication":"Nature Reviews Neuroscience","page":"7 - 21","date_published":"2012-01-01T00:00:00Z","doi":"10.1038/nrn3125","date_created":"2018-12-11T12:02:38Z","_id":"3317","type":"journal_article","status":"public","pubrep_id":"820","date_updated":"2021-01-12T07:42:36Z","ddc":["570"],"department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:46:07Z","abstract":[{"text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"01","intvolume":" 13","publication_status":"published","file":[{"date_updated":"2020-07-14T12:46:07Z","file_size":314246,"creator":"system","date_created":"2018-12-12T10:12:13Z","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4931","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f"},{"checksum":"bceb2efdd49d115f4dde8486bc1be3f2","file_id":"4932","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:12:14Z","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","creator":"system","date_updated":"2020-07-14T12:46:07Z","file_size":1840216}],"language":[{"iso":"eng"}],"volume":13,"issue":"1"},{"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"journal_article","_id":"3314","title":"Discounting and averaging in games across time scales","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"publist_id":"3326","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:35Z","citation":{"mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.","apa":"Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054112400308","ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 2012;23(3):609-625. doi:10.1142/S0129054112400308","ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308.","ista":"Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625."},"month":"04","intvolume":" 23","quality_controlled":"1","scopus_import":1,"publisher":"World Scientific Publishing","oa_version":"None","abstract":[{"lang":"eng","text":"We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company."}],"volume":23,"issue":"3","doi":"10.1142/S0129054112400308","date_published":"2012-04-01T00:00:00Z","date_created":"2018-12-11T12:02:37Z","page":"609 - 625","day":"01","language":[{"iso":"eng"}],"publication":"International Journal of Foundations of Computer Science","year":"2012","publication_status":"published"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete & Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete & Computational Geometry 48 (2012) 964–989.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. Discrete & Computational Geometry. 2012;48(4):964-989. doi:10.1007/s00454-012-9441-5","apa":"Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-012-9441-5","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-012-9441-5.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete & Computational Geometry. 48(4), 964–989."},"title":"Deconstructing approximate offsets","author":[{"last_name":"Berberich","full_name":"Berberich, Eric","first_name":"Eric"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299"},{"first_name":"Roza","full_name":"Pogalnikova, Roza","last_name":"Pogalnikova"}],"publist_id":"3584","external_id":{"arxiv":["1109.2158"]},"acknowledgement":"We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting the digital-pen offset-deconstruction problem. This work has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation (grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational Geometry Learning).\r\n","quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Discrete & Computational Geometry","year":"2012","date_published":"2012-12-01T00:00:00Z","doi":"10.1007/s00454-012-9441-5","date_created":"2018-12-11T12:01:28Z","page":"964 - 989","_id":"3115","status":"public","type":"journal_article","date_updated":"2023-02-23T11:22:30Z","department":[{"_id":"HeEd"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one."}],"month":"12","intvolume":" 48","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.2158"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"4","volume":48,"related_material":{"record":[{"id":"3329","status":"public","relation":"earlier_version"}]}},{"_id":"3331","type":"journal_article","status":"public","date_updated":"2021-01-12T07:42:43Z","citation":{"ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 2012;47(3):239-258. doi:10.1016/j.jsc.2011.11.001","apa":"Kerber, M., & Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2011.11.001","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation. Elsevier, 2012. https://doi.org/10.1016/j.jsc.2011.11.001."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","full_name":"Sagraloff, Michael","last_name":"Sagraloff"}],"publist_id":"3303","title":"A worst case bound for topology computation of algebraic curves","department":[{"_id":"HeEd"}],"abstract":[{"text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"scopus_import":1,"quality_controlled":"1","publisher":"Elsevier","intvolume":" 47","month":"03","publication_status":"published","year":"2012","publication":" Journal of Symbolic Computation","language":[{"iso":"eng"}],"day":"01","page":"239 - 258","date_created":"2018-12-11T12:02:43Z","volume":47,"issue":"3","date_published":"2012-03-01T00:00:00Z","doi":"10.1016/j.jsc.2011.11.001"},{"intvolume":" 45","month":"10","publisher":"IOP Publishing Ltd.","quality_controlled":"1","acknowledgement":"The research was supported by the European Regional Development Funds and the Spanish MICINN projects MAT2010-15138, MAT2010-21510 and CSD2009-00050. JF and AS thank the FI-DGR and BP grants from the Agència de Gestió d'Ajuts Universitaris i de Recerca (AGAUR) from the Catalan Government. MI and AC thank the Spanish MICINN for the PhD grant and the financial support through the Ramóny Cajal program.","oa_version":"None","abstract":[{"text":"Arrays of vertically aligned ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires (NWs) were prepared by means of the combination of two solution-growth processes. First, single-crystal ZnO NWs with controlled n-type doping were grown on conducting substrates by a low-cost, high-yield and seed-free electrochemical route. These NWs were covered by a titanium oxide shell of tunable thickness mediating successive adsorption-hydrolysis-condensation steps. Using this atomic-layer growth procedure, titania shells with controlled thickness and the anatase TiO2 phase were obtained after sintering at 450 °C. Higher sintering temperatures resulted in the formation of ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs by the interdiffusion of Zn and Ti ions at the ZnO–TiO2 interface. The performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs towards photoelectrochemical (PEC) water splitting was investigated as a function of the titania shell thickness. Furthermore, the performance of such core–shell NWs as photoelectrodes in dye-sensitized solar cells was also characterized. The TiO2 presence at the ZnO : Cl surface promoted a two-fold increase on the produced photocurrent densities, probing their potential for PEC and optoelectronic applications. Electrochemical impedance spectroscopy was used to corroborate the lower resistance for charge transfer between the NWs and the electrolyte in the presence of the TiO2 shell.","lang":"eng"}],"date_created":"2018-12-11T11:45:56Z","doi":"10.1088/0022-3727/45/41/415301","volume":45,"issue":"41","date_published":"2012-10-17T00:00:00Z","publication":"Journal of Physics D: Applied Physics","language":[{"iso":"eng"}],"day":"17","publication_status":"published","year":"2012","status":"public","type":"journal_article","article_type":"original","_id":"346","title":"Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness","article_processing_charge":"No","author":[{"first_name":"Jiandong","last_name":"Fan","full_name":"Fan, Jiandong"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"full_name":"Fábrega, Cristina","last_name":"Fábrega","first_name":"Cristina"},{"last_name":"Shavel","full_name":"Shavel, Alexey","first_name":"Alexey"},{"first_name":"Cristina","last_name":"Flox","full_name":"Flox, Cristina"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez"},{"first_name":"Teresa","last_name":"Andreu","full_name":"Andreu, Teresa"},{"full_name":"López, Amtonio","last_name":"López","first_name":"Amtonio"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Joan","full_name":"Morante, Joan","last_name":"Morante"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"publist_id":"7486","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:43:36Z","citation":{"mla":"Fan, Jiandong, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics, vol. 45, no. 41, IOP Publishing Ltd., 2012, doi:10.1088/0022-3727/45/41/415301.","apa":"Fan, J., Zamani, R., Fábrega, C., Shavel, A., Flox, C., Ibáñez, M., … Cabot, A. (2012). Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. IOP Publishing Ltd. https://doi.org/10.1088/0022-3727/45/41/415301","ama":"Fan J, Zamani R, Fábrega C, et al. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 2012;45(41). doi:10.1088/0022-3727/45/41/415301","short":"J. Fan, R. Zamani, C. Fábrega, A. Shavel, C. Flox, M. Ibáñez, T. Andreu, A. López, J. Arbiol, J. Morante, A. Cabot, Journal of Physics D: Applied Physics 45 (2012).","ieee":"J. Fan et al., “Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness,” Journal of Physics D: Applied Physics, vol. 45, no. 41. IOP Publishing Ltd., 2012.","chicago":"Fan, Jiandong, Reza Zamani, Cristina Fábrega, Alexey Shavel, Cristina Flox, Maria Ibáñez, Teresa Andreu, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics. IOP Publishing Ltd., 2012. https://doi.org/10.1088/0022-3727/45/41/415301.","ista":"Fan J, Zamani R, Fábrega C, Shavel A, Flox C, Ibáñez M, Andreu T, López A, Arbiol J, Morante J, Cabot A. 2012. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 45(41)."}},{"acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","oa_version":"None","abstract":[{"lang":"eng","text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk."}],"intvolume":" 431","month":"05","publisher":"Elsevier","scopus_import":1,"quality_controlled":"1","publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"day":"04","publication_status":"published","year":"2012","date_created":"2018-12-11T12:01:47Z","related_material":{"record":[{"relation":"earlier_version","id":"3719","status":"public"}]},"doi":"10.1016/j.tcs.2011.12.059","date_published":"2012-05-04T00:00:00Z","volume":431,"page":"137 - 164","_id":"3168","pubrep_id":"73","status":"public","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.12.059.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059","apa":"Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.12.059"},"date_updated":"2023-02-23T11:39:40Z","title":"Lumpability abstractions of rule based systems","department":[{"_id":"ToHe"}],"publist_id":"3515","author":[{"full_name":"Feret, Jérôme","last_name":"Feret","first_name":"Jérôme"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Koeppl, Heinz","last_name":"Koeppl","first_name":"Heinz"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","last_name":"Petrov"}]},{"_id":"377","type":"journal_article","status":"public","citation":{"ista":"Ibáñez M, Zamani R, Li W, Cadavid D, Gorse S, Katchoi N, Shavel A, López A, Morante J, Arbiol J, Cabot A. 2012. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 24(23), 4615–4622.","chicago":"Ibáñez, Maria, Reza Zamani, Wenhua Li, Doris Cadavid, Stéphane Gorse, Nebll Katchoi, Alexey Shavel, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials. American Chemical Society, 2012. https://doi.org/10.1021/cm303252q.","short":"M. Ibáñez, R. Zamani, W. Li, D. Cadavid, S. Gorse, N. Katchoi, A. Shavel, A. López, J. Morante, J. Arbiol, A. Cabot, Chemistry of Materials 24 (2012) 4615–4622.","ieee":"M. Ibáñez et al., “Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials,” Chemistry of Materials, vol. 24, no. 23. American Chemical Society, pp. 4615–4622, 2012.","ama":"Ibáñez M, Zamani R, Li W, et al. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 2012;24(23):4615-4622. doi:10.1021/cm303252q","apa":"Ibáñez, M., Zamani, R., Li, W., Cadavid, D., Gorse, S., Katchoi, N., … Cabot, A. (2012). Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm303252q","mla":"Ibáñez, Maria, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials, vol. 24, no. 23, American Chemical Society, 2012, pp. 4615–22, doi:10.1021/cm303252q."},"date_updated":"2021-01-12T07:52:04Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7452","author":[{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"},{"first_name":"Reza","last_name":"Zamani","full_name":"Zamani, Reza"},{"last_name":"Li","full_name":"Li, Wenhua","first_name":"Wenhua"},{"first_name":"Doris","full_name":"Cadavid, Doris","last_name":"Cadavid"},{"first_name":"Stéphane","last_name":"Gorse","full_name":"Gorse, Stéphane"},{"full_name":"Katchoi, Nebll","last_name":"Katchoi","first_name":"Nebll"},{"last_name":"Shavel","full_name":"Shavel, Alexey","first_name":"Alexey"},{"first_name":"Antonioo","full_name":"López, Antonioo","last_name":"López"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"article_processing_charge":"No","title":"Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials","abstract":[{"text":"The potential to control the composition and crystal phase at the nanometer scale enable the production of nanocrystalline materials with enhanced functionalities and new applications. In the present work, we detail a novel colloidal synthesis route to prepare nanoparticles of the ternary semiconductor Cu2GeSe3 (CGSe) with nanometer-scale control over their crystal phases. We also demonstrate the structural effect on the thermoelectric properties of bottom-up-prepared CGSe nanomaterials. By careful adjustment of the nucleation and growth temperatures, pure orthorhombic CGSe nanoparticles with cationic order or polytypic CGSe nanoparticles with disordered cation positions can be produced. In this second type of nanoparticle, a high density of twins can be created to periodically change the atomic plane stacking, forming a hexagonal wurtzite CGSe phase. The high yield of the synthetic routes reported here allows the production of single-phase and multiphase CGSe nanoparticles in the gram scale, which permits characterization of the thermoelectric properties of these materials. Reduced thermal conductivities and a related 2.5-fold increase of the thermoelectric figure of merit for multiphase nanomaterials compared to pure-phase CGSe are systematically obtained. These results are discussed in terms of the density and efficiency of phonon scattering centers in both types of materials.","lang":"eng"}],"oa_version":"None","publisher":"American Chemical Society","month":"11","intvolume":" 24","publication_status":"published","year":"2012","day":"14","language":[{"iso":"eng"}],"publication":"Chemistry of Materials","page":"4615 - 4622","volume":24,"doi":"10.1021/cm303252q","issue":"23","date_published":"2012-11-14T00:00:00Z","date_created":"2018-12-11T11:46:07Z"},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5897","checksum":"241b939deb4517cdd4426d49c67e3fa2","creator":"kschuh","date_updated":"2020-07-14T12:46:17Z","file_size":336450,"date_created":"2019-01-29T10:54:28Z","file_name":"a_survey_of_stochastic_omega-regular_games.pdf"}],"volume":78,"issue":"2","abstract":[{"text":"We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://doi.org/10.1016/j.jcss.2011.05.002","open_access":"1"}],"scopus_import":"1","intvolume":" 78","month":"03","date_updated":"2022-05-24T08:00:54Z","ddc":["000"],"file_date_updated":"2020-07-14T12:46:17Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3846","article_type":"original","type":"journal_article","status":"public","year":"2012","has_accepted_license":"1","publication":"Journal of Computer and System Sciences","day":"02","page":"394 - 413","date_created":"2018-12-11T12:05:29Z","date_published":"2012-03-02T00:00:00Z","doi":"10.1016/j.jcss.2011.05.002","acknowledgement":"This research was supported in part by the ONR grant N00014-02-1-0671, by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","oa":1,"quality_controlled":"1","publisher":"Elsevier","citation":{"chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002.","ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.","short":"K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.","ieee":"K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.","apa":"Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002","ama":"Chatterjee K, Henzinger TA. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 2012;78(2):394-413. doi:10.1016/j.jcss.2011.05.002"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"publist_id":"2341","title":"A survey of stochastic ω regular games"},{"date_created":"2018-12-11T11:46:11Z","issue":"20","doi":"10.1103/PhysRevLett.108.206402","date_published":"2012-01-01T00:00:00Z","volume":108,"publication_status":"published","year":"2012","language":[{"iso":"eng"}],"publication":"Physical Review Letters","day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1108.0022"}],"oa":1,"publisher":"American Physical Society","intvolume":" 108","month":"01","abstract":[{"lang":"eng","text":"In this Letter we present detailed study of the density of states near defects in Bi 2Se 3. In particular, we present data on the commonly found triangular defects in this system. While we do not find any measurable quasiparticle scattering interference effects, we do find localized resonances, which can be well fitted by theory once the potential is taken to be extended to properly account for the observed defects. The data together with the fits confirm that while the local density of states around the Dirac point of the electronic spectrum at the surface is significantly disrupted near the impurity by the creation of low-energy resonance state, the Dirac point is not locally destroyed. We discuss our results in terms of the expected protected surface state of topological insulators. © 2012 American Physical Society."}],"oa_version":"None","author":[{"orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev","first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rudro","last_name":"Biswas","full_name":"Biswas, Rudro"},{"last_name":"Balatsky","full_name":"Balatsky, Alexander","first_name":"Alexander"},{"last_name":"Analytis","full_name":"Analytis, James","first_name":"James"},{"full_name":"Chu, Jiunhaw","last_name":"Chu","first_name":"Jiunhaw"},{"first_name":"Ian","full_name":"Fisher, Ian","last_name":"Fisher"},{"full_name":"Kapitulnik, Aharon","last_name":"Kapitulnik","first_name":"Aharon"}],"publist_id":"7442","title":"STM imaging of impurity resonances on Bi 2Se 3","date_updated":"2021-01-12T07:52:49Z","citation":{"ista":"Alpichshev Z, Biswas R, Balatsky A, Analytis J, Chu J, Fisher I, Kapitulnik A. 2012. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 108(20).","chicago":"Alpichshev, Zhanybek, Rudro Biswas, Alexander Balatsky, James Analytis, Jiunhaw Chu, Ian Fisher, and Aharon Kapitulnik. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.108.206402.","ieee":"Z. Alpichshev et al., “STM imaging of impurity resonances on Bi 2Se 3,” Physical Review Letters, vol. 108, no. 20. American Physical Society, 2012.","short":"Z. Alpichshev, R. Biswas, A. Balatsky, J. Analytis, J. Chu, I. Fisher, A. Kapitulnik, Physical Review Letters 108 (2012).","apa":"Alpichshev, Z., Biswas, R., Balatsky, A., Analytis, J., Chu, J., Fisher, I., & Kapitulnik, A. (2012). STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.108.206402","ama":"Alpichshev Z, Biswas R, Balatsky A, et al. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 2012;108(20). doi:10.1103/PhysRevLett.108.206402","mla":"Alpichshev, Zhanybek, et al. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters, vol. 108, no. 20, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.206402."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","type":"journal_article","status":"public","_id":"387"},{"day":"01","publication":"Plant Cell","year":"2012","publication_status":"published","date_published":"2012-06-01T00:00:00Z","issue":"6","volume":24,"doi":"10.1105/tpc.112.098905","date_created":"2018-12-11T12:01:27Z","page":"2497 - 2514","abstract":[{"lang":"eng","text":"The directional transport of the phytohormone auxin depends on the phosphorylation status and polar localization of PIN-FORMED (PIN) auxin efflux proteins. While PINIOD (PID) kinase is directly involved in the phosphorylation of PIN proteins, the phosphatase holoenzyme complexes that dephosphorylate PIN proteins remain elusive. Here, we demonstrate that mutations simultaneously disrupting the function of Arabidopsis thaliana FyPP1 (for Phytochrome-associated serine/threonine protein phosphatase1) and FyPP3, two homologous genes encoding the catalytic subunits of protein phosphatase6 (PP6), cause elevated accumulation of phosphorylated PIN proteins, correlating with a basal-to-apical shift in subcellular PIN localization. The changes in PIN polarity result in increased root basipetal auxin transport and severe defects, including shorter roots, fewer lateral roots, defective columella cells, root meristem collapse, abnormal cotyledons (small, cup-shaped, or fused cotyledons), and altered leaf venation. Our molecular, biochemical, and genetic data support the notion that FyPP1/3, SAL (for SAPS DOMAIN-LIKE), and PP2AA proteins (RCN1 [for ROOTS CURL IN NAPHTHYLPHTHALAMIC ACID1] or PP2AA1, PP2AA2, and PP2AA3) physically interact to form a novel PP6-type heterotrimeric holoenzyme complex. We also show that FyPP1/3, SAL, and PP2AA interact with a subset of PIN proteins and that for SAL the strength of the interaction depends on the PIN phosphorylation status. Thus, an Arabidopsis PP6-type phosphatase holoenzyme acts antagonistically with PID to direct auxin transport polarity and plant development by directly regulating PIN phosphorylation. "}],"month":"06","intvolume":" 24","quality_controlled":0,"publisher":"American Society of Plant Biologists","extern":1,"date_updated":"2021-01-12T07:41:08Z","citation":{"mla":"Dai, Mingqiu, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell, vol. 24, no. 6, American Society of Plant Biologists, 2012, pp. 2497–514, doi:10.1105/tpc.112.098905.","ieee":"M. Dai et al., “A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis,” Plant Cell, vol. 24, no. 6. American Society of Plant Biologists, pp. 2497–2514, 2012.","short":"M. Dai, C. Zhang, U. Kania, F. Chen, Q. Xue, T. Mccray, G. Li, G. Qin, M. Wakeley, W. Terzaghi, J. Wan, Y. Zhao, J. Xu, J. Friml, X. Deng, H. Wang, Plant Cell 24 (2012) 2497–2514.","ama":"Dai M, Zhang C, Kania U, et al. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 2012;24(6):2497-2514. doi:10.1105/tpc.112.098905","apa":"Dai, M., Zhang, C., Kania, U., Chen, F., Xue, Q., Mccray, T., … Wang, H. (2012). A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.112.098905","chicago":"Dai, Mingqiu, Chen Zhang, Urszula Kania, Fang Chen, Qin Xue, Tyra Mccray, Gang Li, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell. American Society of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.098905.","ista":"Dai M, Zhang C, Kania U, Chen F, Xue Q, Mccray T, Li G, Qin G, Wakeley M, Terzaghi W, Wan J, Zhao Y, Xu J, Friml J, Deng X, Wang H. 2012. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 24(6), 2497–2514."},"title":"A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis","publist_id":"3589","author":[{"full_name":"Dai, Mingqiu","last_name":"Dai","first_name":"Mingqiu"},{"first_name":"Chen","last_name":"Zhang","full_name":"Zhang, Chen"},{"last_name":"Kania","full_name":"Urszula Kania","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula"},{"first_name":"Fang","last_name":"Chen","full_name":"Chen, Fang"},{"first_name":"Qin","full_name":"Xue, Qin","last_name":"Xue"},{"first_name":"Tyra","last_name":"Mccray","full_name":"McCray, Tyra"},{"first_name":"Gang","last_name":"Li","full_name":"Li, Gang"},{"last_name":"Qin","full_name":"Qin, Genji","first_name":"Genji"},{"last_name":"Wakeley","full_name":"Wakeley, Michelle","first_name":"Michelle"},{"last_name":"Terzaghi","full_name":"Terzaghi, William","first_name":"William"},{"full_name":"Wan, Jianmin","last_name":"Wan","first_name":"Jianmin"},{"full_name":"Zhao, Yunde","last_name":"Zhao","first_name":"Yunde"},{"first_name":"Jian","full_name":"Xu, Jian","last_name":"Xu"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"},{"full_name":"Deng, Xing W","last_name":"Deng","first_name":"Xing"},{"full_name":"Wang, Haiyang","last_name":"Wang","first_name":"Haiyang"}],"_id":"3110","status":"public","type":"journal_article"},{"abstract":[{"lang":"eng","text":"A cell membrane can be considered a liquid-phase plane in which lipids and proteins theoretically are free to diffuse. Numerous reports,however, describe retarded diffusion ofmembrane proteins in animal cells. This anomalous diffusion results from a combination of structuring factors including protein-protein interactions, cytoskeleton corralling, and lipid organization into microdomains. In plant cells, plasma-membrane (PM) proteins have been described as relatively immobile, but the control mechanisms that structure the PM have not been studied. Here, we use fluorescence recovery after photobleaching to estimate mobility of a set of minimal PM proteins. These proteins consist only of a PM-anchoring domain fused to a fluorescent protein, but their mobilities remained limited, as is the case for many full-length proteins. Neither the cytoskeleton nor membrane microdomain structure was involved in constraining the diffusion of these proteins. The cell wall, however, was shown to have a crucial role in immobilizing PM proteins. In addition, by single-molecule fluorescence imaging we confirmed that the pattern of cellulose deposition in the cell wall affects the trajectory and speed ofPMprotein diffusion. Regulation ofPMprotein dynamics by the plant cell wall can be interpreted as a mechanism for regulating protein interactions in processes such as trafficking and signal transduction."}],"month":"07","intvolume":" 109","publisher":"National Academy of Sciences","quality_controlled":0,"day":"31","publication":"PNAS","publication_status":"published","year":"2012","date_published":"2012-07-31T00:00:00Z","issue":"31","doi":"10.1073/pnas.1202040109","volume":109,"date_created":"2018-12-11T12:01:28Z","page":"12805 - 12810","_id":"3113","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T07:41:09Z","citation":{"mla":"Martinière, Alexandre, et al. “Cell Wall Constrains Lateral Diffusion of Plant Plasma Membrane Proteins.” PNAS, vol. 109, no. 31, National Academy of Sciences, 2012, pp. 12805–10, doi:10.1073/pnas.1202040109.","ieee":"A. Martinière et al., “Cell wall constrains lateral diffusion of plant plasma membrane proteins,” PNAS, vol. 109, no. 31. National Academy of Sciences, pp. 12805–12810, 2012.","short":"A. Martinière, I. Lavagi, G. Nageswaran, D. Rolfe, L. Maneta Peyret, D. Luu, S. Botchway, S. Webb, S. Mongrand, C. Maurel, M. Martin Fernandez, J. Kleine Vehn, J. Friml, P. Moreau, J. Runions, PNAS 109 (2012) 12805–12810.","apa":"Martinière, A., Lavagi, I., Nageswaran, G., Rolfe, D., Maneta Peyret, L., Luu, D., … Runions, J. (2012). Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1202040109","ama":"Martinière A, Lavagi I, Nageswaran G, et al. Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. 2012;109(31):12805-12810. doi:10.1073/pnas.1202040109","chicago":"Martinière, Alexandre, Irene Lavagi, Gayathri Nageswaran, Daniel Rolfe, Lilly Maneta Peyret, Doan Luu, Stanley Botchway, et al. “Cell Wall Constrains Lateral Diffusion of Plant Plasma Membrane Proteins.” PNAS. National Academy of Sciences, 2012. https://doi.org/10.1073/pnas.1202040109.","ista":"Martinière A, Lavagi I, Nageswaran G, Rolfe D, Maneta Peyret L, Luu D, Botchway S, Webb S, Mongrand S, Maurel C, Martin Fernandez M, Kleine Vehn J, Friml J, Moreau P, Runions J. 2012. Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. 109(31), 12805–12810."},"title":"Cell wall constrains lateral diffusion of plant plasma membrane proteins","author":[{"last_name":"Martinière","full_name":"Martinière, Alexandre","first_name":"Alexandre"},{"first_name":"Irene","full_name":"Lavagi, Irene","last_name":"Lavagi"},{"last_name":"Nageswaran","full_name":"Nageswaran, Gayathri","first_name":"Gayathri"},{"first_name":"Daniel","last_name":"Rolfe","full_name":"Rolfe, Daniel J"},{"first_name":"Lilly","last_name":"Maneta Peyret","full_name":"Maneta-Peyret, Lilly"},{"full_name":"Luu, Doan-Trung","last_name":"Luu","first_name":"Doan"},{"last_name":"Botchway","full_name":"Botchway, Stanley W","first_name":"Stanley"},{"first_name":"Stephen","full_name":"Webb, Stephen E","last_name":"Webb"},{"full_name":"Mongrand, Sebastien","last_name":"Mongrand","first_name":"Sebastien"},{"first_name":"Christophe","last_name":"Maurel","full_name":"Maurel, Christophe"},{"last_name":"Martin Fernandez","full_name":"Martin-Fernandez, Marisa L","first_name":"Marisa"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"},{"first_name":"Patrick","full_name":"Moreau, Patrick","last_name":"Moreau"},{"first_name":"John","last_name":"Runions","full_name":"Runions, John"}],"publist_id":"3586"},{"doi":"10.1038/ncomms1941","issue":"AN 941","date_published":"2012-07-03T00:00:00Z","volume":3,"date_created":"2018-12-11T12:01:28Z","publication_status":"published","year":"2012","day":"03","publication":"Nature Communications","quality_controlled":0,"publisher":"Nature Publishing Group","month":"07","intvolume":" 3","abstract":[{"lang":"eng","text":"Auxin is a key coordinative signal required for many aspects of plant development and its levels are controlled by auxin metabolism and intercellular auxin transport. Here we find that a member of PIN auxin transporter family, PIN8 is expressed in male gametophyte of Arabidopsis thaliana and has a crucial role in pollen development and functionality. Ectopic expression in sporophytic tissues establishes a role of PIN8 in regulating auxin homoeostasis and metabolism. PIN8 co-localizes with PIN5 to the endoplasmic reticulum (ER) where it acts as an auxin transporter. Genetic analyses reveal an antagonistic action of PIN5 and PIN8 in the regulation of intracellular auxin homoeostasis and gametophyte as well as sporophyte development. Our results reveal a role of the auxin transport in male gametophyte development in which the distinct actions of ER-localized PIN transporters regulate cellular auxin homoeostasis and maintain the auxin levels optimal for pollen development and pollen tube growth."}],"author":[{"first_name":"Zhaojun","last_name":"Ding","full_name":"Ding, Zhaojun"},{"first_name":"Bangjun","full_name":"Wang, Bangjun","last_name":"Wang"},{"first_name":"Ignacio","full_name":"Moreno, Ignacio","last_name":"Moreno"},{"last_name":"Dupláková","full_name":"Dupláková, Nikoleta","first_name":"Nikoleta"},{"orcid":"0000-0002-1998-6741","full_name":"Sibu Simon","last_name":"Simon","first_name":"Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicola","last_name":"Carraro","full_name":"Carraro, Nicola"},{"full_name":"Reemmer, Jesica","last_name":"Reemmer","first_name":"Jesica"},{"full_name":"Pěnčík, Aleš","last_name":"Pěnčík","first_name":"Aleš"},{"first_name":"Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","full_name":"Xu Chen"},{"first_name":"Ricardo","last_name":"Tejos","full_name":"Tejos, Ricardo I"},{"last_name":"Skůpa","full_name":"Skůpa, Petr","first_name":"Petr"},{"full_name":"Pollmann, Stephan","last_name":"Pollmann","first_name":"Stephan"},{"first_name":"Jozef","full_name":"Mravec, Jozef","last_name":"Mravec"},{"last_name":"Petrášek","full_name":"Petrášek, Jan","first_name":"Jan"},{"last_name":"Zažímalová","full_name":"Zažímalová, Eva","first_name":"Eva"},{"full_name":"Honys, David","last_name":"Honys","first_name":"David"},{"last_name":"Rolčík","full_name":"Rolčík, Jakub","first_name":"Jakub"},{"full_name":"Murphy, Angus S","last_name":"Murphy","first_name":"Angus"},{"full_name":"Orellana, Ariel","last_name":"Orellana","first_name":"Ariel"},{"first_name":"Markus","full_name":"Geisler, Markus","last_name":"Geisler"},{"last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publist_id":"3585","title":"ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis","date_updated":"2021-01-12T07:41:09Z","citation":{"chicago":"Ding, Zhaojun, Bangjun Wang, Ignacio Moreno, Nikoleta Dupláková, Sibu Simon, Nicola Carraro, Jesica Reemmer, et al. “ER-Localized Auxin Transporter PIN8 Regulates Auxin Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature Communications. Nature Publishing Group, 2012. https://doi.org/10.1038/ncomms1941.","ista":"Ding Z, Wang B, Moreno I, Dupláková N, Simon S, Carraro N, Reemmer J, Pěnčík A, Chen X, Tejos R, Skůpa P, Pollmann S, Mravec J, Petrášek J, Zažímalová E, Honys D, Rolčík J, Murphy A, Orellana A, Geisler M, Friml J. 2012. ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. 3(AN 941).","mla":"Ding, Zhaojun, et al. “ER-Localized Auxin Transporter PIN8 Regulates Auxin Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature Communications, vol. 3, no. AN 941, Nature Publishing Group, 2012, doi:10.1038/ncomms1941.","ieee":"Z. Ding et al., “ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis,” Nature Communications, vol. 3, no. AN 941. Nature Publishing Group, 2012.","short":"Z. Ding, B. Wang, I. Moreno, N. Dupláková, S. Simon, N. Carraro, J. Reemmer, A. Pěnčík, X. Chen, R. Tejos, P. Skůpa, S. Pollmann, J. Mravec, J. Petrášek, E. Zažímalová, D. Honys, J. Rolčík, A. Murphy, A. Orellana, M. Geisler, J. Friml, Nature Communications 3 (2012).","apa":"Ding, Z., Wang, B., Moreno, I., Dupláková, N., Simon, S., Carraro, N., … Friml, J. (2012). ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms1941","ama":"Ding Z, Wang B, Moreno I, et al. ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. 2012;3(AN 941). doi:10.1038/ncomms1941"},"extern":1,"type":"journal_article","status":"public","_id":"3114"},{"publist_id":"3588","author":[{"first_name":"Deshu","last_name":"Lin","full_name":"Lin, Deshu"},{"first_name":"Shingo","full_name":"Nagawa, Shingo","last_name":"Nagawa"},{"first_name":"Jisheng","full_name":"Chen, Jisheng","last_name":"Chen"},{"full_name":"Cao, Lingyan","last_name":"Cao","first_name":"Lingyan"},{"id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu","last_name":"Chen","full_name":"Xu Chen"},{"full_name":"Xu, Tongda","last_name":"Xu","first_name":"Tongda"},{"last_name":"Li","full_name":"Hongjiang Li","orcid":"0000-0001-5039-9660","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang"},{"first_name":"Pankaj","last_name":"Dhonukshe","full_name":"Dhonukshe, Pankaj"},{"full_name":"Yamamuro, Chizuko","last_name":"Yamamuro","first_name":"Chizuko"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"},{"last_name":"Scheres","full_name":"Scheres, Ben","first_name":"Ben"},{"first_name":"Ying","full_name":"Fu, Ying","last_name":"Fu"},{"first_name":"Zhenbiao","full_name":"Yang, Zhenbiao","last_name":"Yang"}],"title":"A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots","citation":{"mla":"Lin, Deshu, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology, vol. 22, no. 14, Cell Press, 2012, pp. 1319–25, doi:10.1016/j.cub.2012.05.019.","ama":"Lin D, Nagawa S, Chen J, et al. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. 2012;22(14):1319-1325. doi:10.1016/j.cub.2012.05.019","apa":"Lin, D., Nagawa, S., Chen, J., Cao, L., Chen, X., Xu, T., … Yang, Z. (2012). A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.019","short":"D. Lin, S. Nagawa, J. Chen, L. Cao, X. Chen, T. Xu, H. Li, P. Dhonukshe, C. Yamamuro, J. Friml, B. Scheres, Y. Fu, Z. Yang, Current Biology 22 (2012) 1319–1325.","ieee":"D. Lin et al., “A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots,” Current Biology, vol. 22, no. 14. Cell Press, pp. 1319–1325, 2012.","chicago":"Lin, Deshu, Shingo Nagawa, Jisheng Chen, Lingyan Cao, Xu Chen, Tongda Xu, Hongjiang Li, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology. Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.019.","ista":"Lin D, Nagawa S, Chen J, Cao L, Chen X, Xu T, Li H, Dhonukshe P, Yamamuro C, Friml J, Scheres B, Fu Y, Yang Z. 2012. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. 22(14), 1319–1325."},"date_updated":"2021-01-12T07:41:08Z","extern":1,"type":"journal_article","status":"public","_id":"3111","page":"1319 - 1325","doi":"10.1016/j.cub.2012.05.019","date_published":"2012-07-24T00:00:00Z","volume":22,"issue":"14","date_created":"2018-12-11T12:01:27Z","year":"2012","publication_status":"published","day":"24","publication":"Current Biology","quality_controlled":0,"publisher":"Cell Press","month":"07","intvolume":" 22","abstract":[{"text":"PIN-FORMED (PIN) protein-mediated auxin polar transport is critically important for development, pattern formation, and morphogenesis in plants. Auxin has been implicated in the regulation of polar auxin transport by inhibiting PIN endocytosis [1, 2], but how auxin regulates this process is poorly understood. Our genetic screen identified the Arabidopsis SPIKE1 (SPK1) gene whose loss-of-function mutations increased lateral root density and retarded gravitropic responses, as do pin2 knockout mutations [3]. SPK1 belongs to the conserved DHR2-Dock family of Rho guanine nucleotide exchange factors [4-6]. The spk1 mutations induced PIN2 internalization that was not suppressed by auxin, as did the loss-of-function mutations for Rho-like GTPase from Plants 6 (ROP6)-GTPase or its effector RIC1. Furthermore, SPK1 was required for auxin induction of ROP6 activation. Our results have established a Rho GTPase-based auxin signaling pathway that maintains PIN2 polar distribution to the plasma membrane via inhibition of its internalization in Arabidopsis roots. Our findings provide new insights into signaling mechanisms that underlie the regulation of the dynamic trafficking of PINs required for long-distance auxin transport and that link auxin signaling to PIN-mediated pattern formation and morphogenesis.","lang":"eng"}]},{"date_created":"2018-12-11T12:01:27Z","volume":22,"date_published":"2012-07-24T00:00:00Z","doi":"10.1016/j.cub.2012.05.020","issue":"14","page":"1326 - 1332","publication":"Current Biology","day":"24","publication_status":"published","year":"2012","intvolume":" 22","month":"07","quality_controlled":0,"publisher":"Cell Press","abstract":[{"lang":"eng","text":"The dynamic spatial and temporal distribution of the crucial plant signaling molecule auxin is achieved by feedback coordination of auxin signaling and intercellular auxin transport pathways [1, 2]. Developmental roles of auxin have been attributed predominantly to its effect on transcription; however, an alternative pathway involving AUXIN BINDING PROTEIN1 (ABP1) has been proposed to regulate clathrin-mediated endocytosis in roots and Rho-like GTPase (ROP)-dependent pavement cell interdigitation in leaves [3, 4]. In this study, we show that ROP6 and its downstream effector RIC1 regulate clathrin association with the plasma membrane for clathrin-mediated endocytosis, as well as for its feedback regulation by auxin. Genetic analysis revealed that ROP6/RIC1 acts downstream of ABP1 to regulate endocytosis. This signaling circuit is also involved in the feedback regulation of PIN-FORMED 1 (PIN1) and PIN2 auxin transporters activity (via its constitutive endocytosis) and corresponding auxin transport-mediated processes, including root gravitropism and leave vascular tissue patterning. Our findings suggest that the signaling module auxin-ABP1-ROP6/RIC1-clathrin-PIN1/PIN2 is a shared component of the feedback regulation of auxin transport during both root and aerial development."}],"title":"ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots","author":[{"last_name":"Chen","full_name":"Xu Chen","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu"},{"last_name":"Naramoto","full_name":"Naramoto, Satoshi","first_name":"Satoshi"},{"last_name":"Robert","full_name":"Robert, Stéphanie","first_name":"Stéphanie"},{"first_name":"Ricardo","full_name":"Tejos, Ricardo","last_name":"Tejos"},{"first_name":"Christian","last_name":"Löfke","full_name":"Löfke, Christian"},{"last_name":"Lin","full_name":"Lin, Deshu","first_name":"Deshu"},{"first_name":"Zhenbiao","last_name":"Yang","full_name":"Yang, Zhenbiao"},{"orcid":"0000-0002-8302-7596","full_name":"Jirí Friml","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publist_id":"3587","extern":1,"citation":{"chicago":"Chen, Xu, Satoshi Naramoto, Stéphanie Robert, Ricardo Tejos, Christian Löfke, Deshu Lin, Zhenbiao Yang, and Jiří Friml. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” Current Biology. Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.020.","ista":"Chen X, Naramoto S, Robert S, Tejos R, Löfke C, Lin D, Yang Z, Friml J. 2012. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 22(14), 1326–1332.","mla":"Chen, Xu, et al. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” Current Biology, vol. 22, no. 14, Cell Press, 2012, pp. 1326–32, doi:10.1016/j.cub.2012.05.020.","apa":"Chen, X., Naramoto, S., Robert, S., Tejos, R., Löfke, C., Lin, D., … Friml, J. (2012). ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.020","ama":"Chen X, Naramoto S, Robert S, et al. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 2012;22(14):1326-1332. doi:10.1016/j.cub.2012.05.020","ieee":"X. Chen et al., “ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots,” Current Biology, vol. 22, no. 14. Cell Press, pp. 1326–1332, 2012.","short":"X. Chen, S. Naramoto, S. Robert, R. Tejos, C. Löfke, D. Lin, Z. Yang, J. Friml, Current Biology 22 (2012) 1326–1332."},"date_updated":"2021-01-12T07:41:08Z","status":"public","type":"journal_article","_id":"3112"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.","ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design. Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284."},"title":"A survey of partial-observation stochastic parity games","publist_id":"3570","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication":"Formal Methods in System Design","day":"01","year":"2012","has_accepted_license":"1","date_created":"2018-12-11T12:01:33Z","date_published":"2012-10-01T00:00:00Z","doi":"10.1007/s10703-012-0164-2","page":"268 - 284","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF NFN Grant No. S11407-N23(RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, ERC Advanced grant QUAREM, and FWF Grant No. S11403-N23 (RiSE).","oa":1,"publisher":"Springer","quality_controlled":"1","ddc":["005"],"date_updated":"2021-01-12T07:41:15Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:00Z","_id":"3128","pubrep_id":"303","status":"public","type":"journal_article","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf","date_created":"2018-12-12T10:11:27Z","file_size":163983,"date_updated":"2020-07-14T12:46:00Z","creator":"system","checksum":"dd3d590f383bb2ac6cfda1489ac1c42a","file_id":"4882","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","ec_funded":1,"volume":43,"issue":"2","oa_version":"Submitted Version","abstract":[{"text":"We consider two-player zero-sum stochastic games on graphs with ω-regular winning conditions specified as parity objectives. These games have applications in the design and control of reactive systems. We survey the complexity results for the problem of deciding the winner in such games, and in classes of interest obtained as special cases, based on the information and the power of randomization available to the players, on the class of objectives and on the winning mode. On the basis of information, these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have complete view of the game). The one-sided partial-observation games have two important subclasses: the one-player games, known as partial-observation Markov decision processes (POMDPs), and the blind one-player games, known as probabilistic automata. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Finally, various classes of games are obtained by restricting the parity objective to a reachability, safety, Büchi, or coBüchi condition. We also consider several winning modes, such as sure-winning (i.e., all outcomes of a strategy have to satisfy the winning condition), almost-sure winning (i.e., winning with probability 1), limit-sure winning (i.e., winning with probability arbitrarily close to 1), and value-threshold winning (i.e., winning with probability at least ν, where ν is a given rational). ","lang":"eng"}],"intvolume":" 43","month":"10","scopus_import":1},{"date_updated":"2023-02-23T11:13:25Z","ddc":["000"],"file_date_updated":"2020-07-14T12:46:00Z","department":[{"_id":"ChLa"}],"_id":"3125","type":"conference","conference":{"name":"ECCV: European Conference on Computer Vision","location":"Florence, Italy","end_date":"2012-10-13","start_date":"2012-10-07"},"status":"public","publication_status":"published","file":[{"date_created":"2020-05-15T12:29:04Z","file_name":"2012_ECCV_Sharmanska.pdf","date_updated":"2020-07-14T12:46:00Z","file_size":6073897,"creator":"dernst","checksum":"bccdbe0663780d25a1e0524002b2d896","file_id":"7861","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":7576,"issue":"PART 5","abstract":[{"lang":"eng","text":"We propose a new learning method to infer a mid-level feature representation that combines the advantage of semantic attribute representations with the higher expressive power of non-semantic features. The idea lies in augmenting an existing attribute-based representation with additional dimensions for which an autoencoder model is coupled with a large-margin principle. This construction allows a smooth transition between the zero-shot regime with no training example, the unsupervised regime with training examples but without class labels, and the supervised regime with training examples and with class labels. The resulting optimization problem can be solved efficiently, because several of the necessity steps have closed-form solutions. Through extensive experiments we show that the augmented representation achieves better results in terms of object categorization accuracy than the semantic representation alone."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":1,"month":"10","intvolume":" 7576","citation":{"ama":"Sharmanska V, Quadrianto N, Lampert C. Augmented attribute representations. In: Vol 7576. Springer; 2012:242-255. doi:10.1007/978-3-642-33715-4_18","apa":"Sharmanska, V., Quadrianto, N., & Lampert, C. (2012). Augmented attribute representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference on Computer Vision, Florence, Italy: Springer. https://doi.org/10.1007/978-3-642-33715-4_18","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,” presented at the ECCV: European Conference on Computer Vision, Florence, Italy, 2012, vol. 7576, no. PART 5, pp. 242–255.","mla":"Sharmanska, Viktoriia, et al. Augmented Attribute Representations. Vol. 7576, no. PART 5, Springer, 2012, pp. 242–55, doi:10.1007/978-3-642-33715-4_18.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations. ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented Attribute Representations,” 7576:242–55. Springer, 2012. https://doi.org/10.1007/978-3-642-33715-4_18."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3574","author":[{"last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308","first_name":"Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Novi","last_name":"Quadrianto","full_name":"Quadrianto, Novi"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"article_processing_charge":"No","title":"Augmented attribute representations","has_accepted_license":"1","year":"2012","day":"01","page":"242 - 255","date_published":"2012-10-01T00:00:00Z","doi":"10.1007/978-3-642-33715-4_18","date_created":"2018-12-11T12:01:32Z","quality_controlled":"1","publisher":"Springer","oa":1},{"intvolume":" 7357","month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.3793"}],"alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Let K be a simplicial complex and g the rank of its p-th homology group Hp(K) defined with ℤ2 coefficients. We show that we can compute a basis H of Hp(K) and annotate each p-simplex of K with a binary vector of length g with the following property: the annotations, summed over all p-simplices in any p-cycle z, provide the coordinate vector of the homology class [z] in the basis H. The basis and the annotations for all simplices can be computed in O(n ω ) time, where n is the size of K and ω < 2.376 is a quantity so that two n×n matrices can be multiplied in O(n ω ) time. The precomputed annotations permit answering queries about the independence or the triviality of p-cycles efficiently.\r\n\r\nUsing annotations of edges in 2-complexes, we derive better algorithms for computing optimal basis and optimal homologous cycles in 1 - dimensional homology. Specifically, for computing an optimal basis of H1(K) , we improve the previously known time complexity from O(n 4) to O(n ω + n 2 g ω − 1). Here n denotes the size of the 2-skeleton of K and g the rank of H1(K) . Computing an optimal cycle homologous to a given 1-cycle is NP-hard even for surfaces and an algorithm taking 2 O(g) nlogn time is known for surfaces. We extend this algorithm to work with arbitrary 2-complexes in O(n ω ) + 2 O(g) n 2logn time using annotations.\r\n"}],"volume":7357,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"name":"SWAT: Symposium and Workshops on Algorithm Theory","location":"Helsinki, Finland","end_date":"2012-07-06","start_date":"2012-07-04"},"type":"conference","_id":"3129","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:41:15Z","oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T12:01:33Z","date_published":"2012-06-19T00:00:00Z","doi":"10.1007/978-3-642-31155-0_17","page":"189 - 200","day":"19","year":"2012","title":"Annotating simplices with a homology basis and its applications","external_id":{"arxiv":["1107.3793"]},"author":[{"last_name":"Busaryev","full_name":"Busaryev, Oleksiy","first_name":"Oleksiy"},{"last_name":"Cabello","full_name":"Cabello, Sergio","first_name":"Sergio"},{"full_name":"Chen, Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao"},{"first_name":"Tamal","full_name":"Dey, Tamal","last_name":"Dey"},{"last_name":"Wang","full_name":"Wang, Yusu","first_name":"Yusu"}],"publist_id":"3569","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm Theory, LNCS, vol. 7357, 189–200.","chicago":"Busaryev, Oleksiy, Sergio Cabello, Chao Chen, Tamal Dey, and Yusu Wang. “Annotating Simplices with a Homology Basis and Its Applications,” 7357:189–200. Springer, 2012. https://doi.org/10.1007/978-3-642-31155-0_17.","ama":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. Annotating simplices with a homology basis and its applications. In: Vol 7357. Springer; 2012:189-200. doi:10.1007/978-3-642-31155-0_17","apa":"Busaryev, O., Cabello, S., Chen, C., Dey, T., & Wang, Y. (2012). Annotating simplices with a homology basis and its applications (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer. https://doi.org/10.1007/978-3-642-31155-0_17","ieee":"O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices with a homology basis and its applications,” presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.","short":"O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200.","mla":"Busaryev, Oleksiy, et al. Annotating Simplices with a Homology Basis and Its Applications. Vol. 7357, Springer, 2012, pp. 189–200, doi:10.1007/978-3-642-31155-0_17."}},{"language":[{"iso":"eng"}],"day":"14","publication_status":"published","year":"2012","date_created":"2018-12-11T12:01:32Z","doi":"10.1007/978-3-642-32717-9_21","date_published":"2012-08-14T00:00:00Z","volume":7476,"page":"205 - 215","oa_version":"None","abstract":[{"text":"In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficient algorithm with low runtime complexity. The algorithm has a single free parameter, the number of clusters to find. We demonstrate superior performance on several synthetic and real datasets.\r\n","lang":"eng"}],"intvolume":" 7476","month":"08","quality_controlled":"1","alternative_title":["LNCS"],"publisher":"Springer","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Müller, A., Nowozin, S., & Lampert, C. (2012). Information theoretic clustering using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM: German Association For Pattern Recognition, Graz, Austria: Springer. https://doi.org/10.1007/978-3-642-32717-9_21","ama":"Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:10.1007/978-3-642-32717-9_21","ieee":"A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering using minimal spanning trees,” presented at the DAGM: German Association For Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.","short":"A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215.","mla":"Müller, Andreas, et al. Information Theoretic Clustering Using Minimal Spanning Trees. Vol. 7476, Springer, 2012, pp. 205–15, doi:10.1007/978-3-642-32717-9_21.","ista":"Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS, vol. 7476, 205–215.","chicago":"Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012. https://doi.org/10.1007/978-3-642-32717-9_21."},"date_updated":"2021-01-12T07:41:14Z","department":[{"_id":"ChLa"}],"title":"Information theoretic clustering using minimal spanning trees","author":[{"first_name":"Andreas","full_name":"Müller, Andreas","last_name":"Müller"},{"full_name":"Nowozin, Sebastian","last_name":"Nowozin","first_name":"Sebastian"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"publist_id":"3573","_id":"3126","status":"public","conference":{"end_date":"2012-08-31","location":"Graz, Austria","start_date":"2012-08-28","name":"DAGM: German Association For Pattern Recognition"},"type":"conference"},{"acknowledgement":"Research partially supported by the Danish-Chinese Center for Cyber Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.","oa":1,"publisher":"Springer","quality_controlled":"1","day":"01","year":"2012","has_accepted_license":"1","date_created":"2018-12-11T12:01:43Z","date_published":"2012-06-01T00:00:00Z","doi":"10.1007/978-3-642-30793-5_13","page":"203 - 218","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18. Springer, 2012. https://doi.org/10.1007/978-3-642-30793-5_13.","ista":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous interface theories and time triggered scheduling. FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , LNCS, vol. 7273, 203–218.","mla":"Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13.","ieee":"B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218.","short":"B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.","ama":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218. doi:10.1007/978-3-642-30793-5_13","apa":"Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., & Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer. https://doi.org/10.1007/978-3-642-30793-5_13"},"title":"Synchronous interface theories and time triggered scheduling","author":[{"first_name":"Benoît","last_name":"Delahaye","full_name":"Delahaye, Benoît"},{"last_name":"Fahrenberg","full_name":"Fahrenberg, Uli","first_name":"Uli"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"}],"publist_id":"3539","oa_version":"Submitted Version","abstract":[{"text":"We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies on a guarded-command based language and is equipped with shared variables and explicit discrete-time clocks. We define all standard interface operations: compatibility checking, composition, refinement, and shared refinement. Apart from the synchronous interface model, the contribution of this paper is the establishment of a formal relation between interface theories and real-time scheduling, where we demonstrate a fully automatic framework for the incremental computation of time-triggered schedules.","lang":"eng"}],"intvolume":" 7273","month":"06","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"feae2e07f2d9a59843f8ddabf25d179f","file_id":"4879","creator":"system","date_updated":"2020-07-14T12:46:01Z","file_size":493198,"date_created":"2018-12-12T10:11:25Z","file_name":"IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf"}],"publication_status":"published","volume":7273,"_id":"3155","pubrep_id":"88","status":"public","conference":{"name":"FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems ","end_date":"2012-06-16","location":"Stockholm, Sweden","start_date":"2012-06-13"},"type":"conference","ddc":["004"],"date_updated":"2021-01-12T07:41:26Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:01Z"},{"author":[{"first_name":"Yuriy","last_name":"Mileyko","full_name":"Mileyko, Yuriy"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Price, Charles","last_name":"Price","first_name":"Charles"},{"last_name":"Weitz","full_name":"Weitz, Joshua","first_name":"Joshua"}],"publist_id":"3530","title":"Hierarchical ordering of reticular networks","citation":{"mla":"Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.","short":"Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).","ieee":"Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science, 2012.","ama":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular networks. PLoS One. 2012;7(6). doi:10.1371/journal.pone.0036715","apa":"Mileyko, Y., Edelsbrunner, H., Price, C., & Weitz, J. (2012). Hierarchical ordering of reticular networks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036715","chicago":"Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0036715.","ista":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_number":"e36715","date_created":"2018-12-11T12:01:44Z","date_published":"2012-06-06T00:00:00Z","doi":"10.1371/journal.pone.0036715","year":"2012","has_accepted_license":"1","publication":"PLoS One","day":"06","oa":1,"quality_controlled":"1","publisher":"Public Library of Science","acknowledgement":"his work was supported by the National Science Foundation Plant Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European Science Foundation (under the Research Networking Programme on “Applied and Computational Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring preparation of this manuscript the authors became aware of a related work by Katifori and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication in PLoS ONE.","file_date_updated":"2020-07-14T12:46:01Z","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:41:28Z","ddc":["510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"385","status":"public","_id":"3159","issue":"6","volume":7,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"515a98ad72e470752f03f13663dcaff8","file_id":"5922","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2012_PLoS_Mileyko.PDF","date_created":"2019-02-05T12:38:43Z","creator":"kschuh","file_size":541583,"date_updated":"2020-07-14T12:46:01Z"}],"scopus_import":1,"intvolume":" 7","month":"06","abstract":[{"lang":"eng","text":"The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the "root" of the network (e.g., the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied to networks with loops because they they create a contradiction in the edge ordering in terms of which edge precedes another in the hierarchy. Here, we present a generalization of the Horton-Strahler order to weighted planar reticular networks, where weights are assumed to correlate with the importance of network edges, e.g., weights estimated from edge widths may correlate to flow capacity. Our method assigns hierarchical levels not only to edges of the network, but also to its loops, and classifies the edges into reticular edges, which are responsible for loop formation, and tree edges. In addition, we perform a detailed and rigorous theoretical analysis of the sensitivity of the hierarchical levels to weight perturbations. In doing so, we show that the ordering of the reticular edges is more robust to noise in weight estimation than is the ordering of the tree edges. We discuss applications of this generalized Horton-Strahler ordering to the study of leaf venation and other biological networks."}],"oa_version":"Published Version"},{"type":"journal_article","status":"public","_id":"3156","publist_id":"3538","author":[{"orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V","last_name":"Ugelvig","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anne","full_name":"Andersen, Anne","last_name":"Andersen"},{"full_name":"Boomsma, Jacobus","last_name":"Boomsma","first_name":"Jacobus"},{"first_name":"David","last_name":"Nash","full_name":"Nash, David"}],"department":[{"_id":"SyCr"}],"title":"Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion","date_updated":"2021-01-12T07:41:27Z","citation":{"short":"L.V. Ugelvig, A. Andersen, J. Boomsma, D. Nash, Molecular Ecology 21 (2012) 3224–3236.","ieee":"L. V. Ugelvig, A. Andersen, J. Boomsma, and D. Nash, “Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion,” Molecular Ecology, vol. 21, no. 13. Wiley-Blackwell, pp. 3224–3236, 2012.","apa":"Ugelvig, L. V., Andersen, A., Boomsma, J., & Nash, D. (2012). Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1111/j.1365-294X.2012.05592.x","ama":"Ugelvig LV, Andersen A, Boomsma J, Nash D. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 2012;21(13):3224-3236. doi:10.1111/j.1365-294X.2012.05592.x","mla":"Ugelvig, Line V., et al. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” Molecular Ecology, vol. 21, no. 13, Wiley-Blackwell, 2012, pp. 3224–36, doi:10.1111/j.1365-294X.2012.05592.x.","ista":"Ugelvig LV, Andersen A, Boomsma J, Nash D. 2012. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 21(13), 3224–3236.","chicago":"Ugelvig, Line V, Anne Andersen, Jacobus Boomsma, and David Nash. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” Molecular Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1365-294X.2012.05592.x."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley-Blackwell","scopus_import":1,"quality_controlled":"1","intvolume":" 21","month":"07","abstract":[{"lang":"eng","text":"Dispersal is crucial for gene flow and often determines the long-term stability of meta-populations, particularly in rare species with specialized life cycles. Such species are often foci of conservation efforts because they suffer disproportionally from degradation and fragmentation of their habitat. However, detailed knowledge of effective gene flow through dispersal is often missing, so that conservation strategies have to be based on mark-recapture observations that are suspected to be poor predictors of long-distance dispersal. These constraints have been especially severe in the study of butterfly populations, where microsatellite markers have been difficult to develop. We used eight microsatellite markers to analyse genetic population structure of the Large Blue butterfly Maculinea arion in Sweden. During recent decades, this species has become an icon of insect conservation after massive decline throughout Europe and extinction in Britain followed by reintroduction of a seed population from the Swedish island of Öland. We find that populations are highly structured genetically, but that gene flow occurs over distances 15 times longer than the maximum distance recorded from mark-recapture studies, which can only be explained by maximum dispersal distances at least twice as large as previously accepted. However, we also find evidence that gaps between sites with suitable habitat exceeding ∼ 20 km induce genetic erosion that can be detected from bottleneck analyses. Although further work is needed, our results suggest that M. arion can maintain fully functional metapopulations when they consist of optimal habitat patches that are no further apart than ∼10 km."}],"acknowledgement":"The work was financed by the Danish National Science Research Foundation via a grant to the Centre for Social Evolution.\r\nWe thank four anonymous reviewers for useful comments on the manuscript, J. Bergsten, P. Bina, B. Carlsson, M. Johannesson and A.E. Lomborg for providing additional wingtip samples, A. Illum for assistance in the field, and in particular P.S. Nielsen for mediating the contact to the collectors and the Swedish authorities. Collection was made possible through a permit by the Åtgärdsprogrammet, supported by the Swedish Environmental Protection Agency.","oa_version":"None","page":"3224 - 3236","date_created":"2018-12-11T12:01:43Z","date_published":"2012-07-01T00:00:00Z","volume":21,"issue":"13","doi":"10.1111/j.1365-294X.2012.05592.x","year":"2012","publication_status":"published","language":[{"iso":"eng"}],"publication":"Molecular Ecology","day":"01"},{"department":[{"_id":"MiSi"}],"date_updated":"2021-01-12T07:41:27Z","status":"public","type":"journal_article","_id":"3158","volume":91,"issue":"11-12","language":[{"iso":"eng"}],"publication_status":"published","month":"11","intvolume":" 91","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3930012/","open_access":"1"}],"oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"We describe here the development and characterization of a conditionally inducible mouse model expressing Lifeact-GFP, a peptide that reports the dynamics of filamentous actin. We have used this model to study platelets, megakaryocytes and melanoblasts and we provide evidence that Lifeact-GFP is a useful reporter in these cell types ex vivo. In the case of platelets and megakaryocytes, these cells are not transfectable by traditional methods, so conditional activation of Lifeact allows the study of actin dynamics in these cells live. We studied melanoblasts in native skin explants from embryos, allowing the visualization of live actin dynamics during cytokinesis and migration. Our study revealed that melanoblasts lacking the small GTPase Rac1 show a delay in the formation of new pseudopodia following cytokinesis that accounts for the previously reported cytokinesis delay in these cells. Thus, through use of this mouse model, we were able to gain insights into the actin dynamics of cells that could only previously be studied using fixed specimens or following isolation from their native tissue environment.","lang":"eng"}],"title":"Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo","author":[{"full_name":"Schachtner, Hannah","last_name":"Schachtner","first_name":"Hannah"},{"first_name":"Ang","full_name":"Li, Ang","last_name":"Li"},{"first_name":"David","last_name":"Stevenson","full_name":"Stevenson, David"},{"last_name":"Calaminus","full_name":"Calaminus, Simon","first_name":"Simon"},{"first_name":"Steven","last_name":"Thomas","full_name":"Thomas, Steven"},{"last_name":"Watson","full_name":"Watson, Steve","first_name":"Steve"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Roland","full_name":"Wedlich Söldner, Roland","last_name":"Wedlich Söldner"},{"first_name":"Douglas","last_name":"Strathdee","full_name":"Strathdee, Douglas"},{"last_name":"Machesky","full_name":"Machesky, Laura","first_name":"Laura"}],"publist_id":"3534","external_id":{"pmid":["22658956"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Schachtner H, Li A, Stevenson D, Calaminus S, Thomas S, Watson S, Sixt MK, Wedlich Söldner R, Strathdee D, Machesky L. 2012. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. 91(11–12), 923–929.","chicago":"Schachtner, Hannah, Ang Li, David Stevenson, Simon Calaminus, Steven Thomas, Steve Watson, Michael K Sixt, Roland Wedlich Söldner, Douglas Strathdee, and Laura Machesky. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” European Journal of Cell Biology. Elsevier, 2012. https://doi.org/10.1016/j.ejcb.2012.04.002.","short":"H. Schachtner, A. Li, D. Stevenson, S. Calaminus, S. Thomas, S. Watson, M.K. Sixt, R. Wedlich Söldner, D. Strathdee, L. Machesky, European Journal of Cell Biology 91 (2012) 923–929.","ieee":"H. Schachtner et al., “Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo,” European Journal of Cell Biology, vol. 91, no. 11–12. Elsevier, pp. 923–929, 2012.","apa":"Schachtner, H., Li, A., Stevenson, D., Calaminus, S., Thomas, S., Watson, S., … Machesky, L. (2012). Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. Elsevier. https://doi.org/10.1016/j.ejcb.2012.04.002","ama":"Schachtner H, Li A, Stevenson D, et al. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. 2012;91(11-12):923-929. doi:10.1016/j.ejcb.2012.04.002","mla":"Schachtner, Hannah, et al. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” European Journal of Cell Biology, vol. 91, no. 11–12, Elsevier, 2012, pp. 923–29, doi:10.1016/j.ejcb.2012.04.002."},"doi":"10.1016/j.ejcb.2012.04.002","date_published":"2012-11-01T00:00:00Z","date_created":"2018-12-11T12:01:44Z","page":"923 - 929","day":"01","publication":"European Journal of Cell Biology","year":"2012","quality_controlled":"1","publisher":"Elsevier","oa":1},{"citation":{"mla":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” Journal of Real-Time Image Processing, vol. 7, no. 1, Springer, 2012, pp. 31–41, doi:10.1007/s11554-010-0168-3.","short":"C. Lampert, J. Peters, Journal of Real-Time Image Processing 7 (2012) 31–41.","ieee":"C. Lampert and J. Peters, “Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components,” Journal of Real-Time Image Processing, vol. 7, no. 1. Springer, pp. 31–41, 2012.","apa":"Lampert, C., & Peters, J. (2012). Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. Springer. https://doi.org/10.1007/s11554-010-0168-3","ama":"Lampert C, Peters J. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 2012;7(1):31-41. doi:10.1007/s11554-010-0168-3","chicago":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” Journal of Real-Time Image Processing. Springer, 2012. https://doi.org/10.1007/s11554-010-0168-3.","ista":"Lampert C, Peters J. 2012. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 7(1), 31–41."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"},{"first_name":"Jan","last_name":"Peters","full_name":"Peters, Jan"}],"publist_id":"3417","title":"Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components","oa":1,"publisher":"Springer","quality_controlled":"1","year":"2012","has_accepted_license":"1","publication":"Journal of Real-Time Image Processing","day":"01","page":"31 - 41","date_created":"2018-12-11T12:02:15Z","date_published":"2012-03-01T00:00:00Z","doi":"10.1007/s11554-010-0168-3","_id":"3248","type":"journal_article","article_type":"original","status":"public","date_updated":"2022-05-24T08:05:40Z","ddc":["000"],"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-14T12:46:04Z","abstract":[{"text":"We describe RTblob, a high speed vision system that detects objects in cluttered scenes based on their color and shape at a speed of over 800 frames/s. Because the system is available as open-source software and relies only on off-the-shelf PC hardware components, it can provide the basis for multiple application scenarios. As an illustrative example, we show how RTblob can be used in a robotic table tennis scenario to estimate ball trajectories through 3D space simultaneously from four cameras images at a speed of 200 Hz.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","intvolume":" 7","month":"03","publication_status":"published","publication_identifier":{"eissn":["1861-8219"],"issn":["1861-8200"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2012_Springer_Lampert.pdf","date_created":"2019-02-12T10:52:25Z","file_size":2933187,"date_updated":"2020-07-14T12:46:04Z","creator":"kschuh","file_id":"5958","checksum":"241be47ea50e81a283bcf4c45b07e8cc","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"volume":7,"issue":"1"},{"abstract":[{"text":"The Brazilian Merganser is a very rare and threatened species that nowadays inhabits only a few protected areas and their surroundings in the Brazilian territory. In order to estimate the remaining genetic diversity and population structure in this species, two mitochondrial genes were sequenced in 39 individuals belonging to two populations and in one individual collected in Argentina in 1950. We found a highly significant divergence between two major remaining populations of Mergus octosetaceus, which suggests a historical population structure in this species. Furthermore, two deeply divergent lineages were found in a single location, which could due to current or historical secondary contact. Based on the available genetic data, we point out future directions which would contribute to design strategies for conservation and management of this threatened species.","lang":"eng"}],"oa_version":"None","acknowledgement":"The present study received grants from FAPEMIG, CNPq, Petrobras Ambiental and Fundação O Boticário de Conservação da Natureza, and followed all ethical guidelines and legal requirements of Brazil for sampling and studying an endangered species.\r\nWe thank the Specialist Work Group for the Conservation of Brazilian Merganser for valuable discussions and opinions on this manuscript. We also thank all the staff from Instituto Terra Brasilis and Funatura (Vivian S. Braz and Gislaine Disconzi) for collecting the samples at Serra da Canastra and Chapada dos Veadeiros, respectively; Dario A. Lijtmaerand and Pablo Tubaro for providing the samples from Argentina, Bradley C. Livezey for sending copies of his papers, and Geoff M. Hilton and Paulo de Tarso Z. Antas for useful suggestions that greatly improved this manuscript.","scopus_import":1,"quality_controlled":"1","publisher":"Springer","month":"02","intvolume":" 13","year":"2012","publication_status":"published","day":"01","language":[{"iso":"eng"}],"publication":"Conservation Genetics","page":"293 - 298","doi":"10.1007/s10592-011-0262-5","volume":13,"issue":"1","date_published":"2012-02-01T00:00:00Z","date_created":"2018-12-11T12:02:15Z","_id":"3247","type":"journal_article","status":"public","citation":{"ista":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. 2012. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 13(1), 293–298.","chicago":"Vilaça, Sibelle, Rodrigo A Fernandes Redondo, Lívia Lins, and Fabrício Santos. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” Conservation Genetics. Springer, 2012. https://doi.org/10.1007/s10592-011-0262-5.","ieee":"S. Vilaça, R. A. Fernandes Redondo, L. Lins, and F. Santos, “Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus),” Conservation Genetics, vol. 13, no. 1. Springer, pp. 293–298, 2012.","short":"S. Vilaça, R.A. Fernandes Redondo, L. Lins, F. Santos, Conservation Genetics 13 (2012) 293–298.","ama":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 2012;13(1):293-298. doi:10.1007/s10592-011-0262-5","apa":"Vilaça, S., Fernandes Redondo, R. A., Lins, L., & Santos, F. (2012). Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. Springer. https://doi.org/10.1007/s10592-011-0262-5","mla":"Vilaça, Sibelle, et al. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” Conservation Genetics, vol. 13, no. 1, Springer, 2012, pp. 293–98, doi:10.1007/s10592-011-0262-5."},"date_updated":"2021-01-12T07:42:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3420","author":[{"last_name":"Vilaça","full_name":"Vilaça, Sibelle","first_name":"Sibelle"},{"last_name":"Fernandes Redondo","full_name":"Fernandes Redondo, Rodrigo A","orcid":"0000-0002-5837-2793","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","first_name":"Rodrigo A"},{"first_name":"Lívia","full_name":"Lins, Lívia","last_name":"Lins"},{"full_name":"Santos, Fabrício","last_name":"Santos","first_name":"Fabrício"}],"department":[{"_id":"JoBo"}],"title":"Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus)"},{"abstract":[{"text":"How cells orchestrate their behavior during collective migration is a long-standing question. Using magnetic tweezers to apply mechanical stimuli to Xenopus mesendoderm cells, Weber etal. (2012) now reveal, in this issue of Developmental Cell, a cadherin-mediated mechanosensitive response that promotes cell polarization and movement persistence during the collective mesendoderm migration in gastrulation.","lang":"eng"}],"oa_version":"None","scopus_import":1,"quality_controlled":"1","publisher":"Cell Press","month":"01","intvolume":" 22","publication_status":"published","year":"2012","day":"17","publication":"Developmental Cell","language":[{"iso":"eng"}],"page":"3 - 4","date_published":"2012-01-17T00:00:00Z","doi":"10.1016/j.devcel.2011.12.018","issue":"1","volume":22,"date_created":"2018-12-11T12:02:14Z","_id":"3245","type":"journal_article","status":"public","citation":{"mla":"Behrndt, Martin, and Carl-Philipp J. Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” Developmental Cell, vol. 22, no. 1, Cell Press, 2012, pp. 3–4, doi:10.1016/j.devcel.2011.12.018.","ieee":"M. Behrndt and C.-P. J. Heisenberg, “Spurred by resistance mechanosensation in collective migration,” Developmental Cell, vol. 22, no. 1. Cell Press, pp. 3–4, 2012.","short":"M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 22 (2012) 3–4.","ama":"Behrndt M, Heisenberg C-PJ. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 2012;22(1):3-4. doi:10.1016/j.devcel.2011.12.018","apa":"Behrndt, M., & Heisenberg, C.-P. J. (2012). Spurred by resistance mechanosensation in collective migration. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2011.12.018","chicago":"Behrndt, Martin, and Carl-Philipp J Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” Developmental Cell. Cell Press, 2012. https://doi.org/10.1016/j.devcel.2011.12.018.","ista":"Behrndt M, Heisenberg C-PJ. 2012. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 22(1), 3–4."},"date_updated":"2021-01-12T07:42:05Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3426","author":[{"id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Behrndt","full_name":"Behrndt, Martin"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"title":"Spurred by resistance mechanosensation in collective migration","department":[{"_id":"CaHe"}]},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1112.5026"}],"scopus_import":1,"intvolume":" 85","month":"04","abstract":[{"lang":"eng","text":"Living cells must control the reading out or "expression" of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point."}],"oa_version":"Preprint","issue":"4","volume":85,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"3262","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T07:42:14Z","oa":1,"quality_controlled":"1","publisher":"American Institute of Physics","acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","date_created":"2018-12-11T12:02:20Z","date_published":"2012-04-01T00:00:00Z","doi":"10.1103/PhysRevE.85.041903","year":"2012","publication":" Physical Review E statistical nonlinear and soft matter physics ","day":"01","article_number":"041903","publist_id":"3386","author":[{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik"},{"full_name":"Walczak, Aleksandra","last_name":"Walczak","first_name":"Aleksandra"},{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"}],"title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","citation":{"mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” Physical Review E Statistical Nonlinear and Soft Matter Physics , vol. 85, no. 4, 041903, American Institute of Physics, 2012, doi:10.1103/PhysRevE.85.041903.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E statistical nonlinear and soft matter physics . 2012;85(4). doi:10.1103/PhysRevE.85.041903","apa":"Tkačik, G., Walczak, A., & Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics. https://doi.org/10.1103/PhysRevE.85.041903","short":"G. Tkačik, A. Walczak, W. Bialek, Physical Review E Statistical Nonlinear and Soft Matter Physics 85 (2012).","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” Physical Review E statistical nonlinear and soft matter physics , vol. 85, no. 4. American Institute of Physics, 2012.","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics, 2012. https://doi.org/10.1103/PhysRevE.85.041903.","ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E statistical nonlinear and soft matter physics . 85(4), 041903."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"external_id":{"arxiv":["1005.2305"]},"publist_id":"3397","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"title":"Generalized roof duality and bisubmodular functions","citation":{"ama":"Kolmogorov V. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 2012;160(4-5):416-426. doi:10.1016/j.dam.2011.10.026","apa":"Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2011.10.026","ieee":"V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.","mla":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.","ista":"Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.","chicago":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2011.10.026."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"416 - 426","date_created":"2018-12-11T12:02:18Z","doi":"10.1016/j.dam.2011.10.026","date_published":"2012-03-01T00:00:00Z","year":"2012","publication":"Discrete Applied Mathematics","day":"01","oa":1,"quality_controlled":"1","publisher":"Elsevier","department":[{"_id":"VlKo"}],"date_updated":"2023-02-23T11:04:49Z","type":"journal_article","status":"public","_id":"3257","related_material":{"record":[{"status":"public","id":"2934","relation":"earlier_version"}]},"volume":160,"issue":"4-5","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1005.2305"}],"scopus_import":1,"intvolume":" 160","month":"03","abstract":[{"text":"Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms.","lang":"eng"}],"oa_version":"Preprint"},{"department":[{"_id":"NiBa"}],"title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","author":[{"last_name":"de Vladar","full_name":"de Vladar, Harold","orcid":"0000-0002-5985-7653","first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chela Flores, Julian","last_name":"Chela Flores","first_name":"Julian"}],"publist_id":"3369","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:20Z","citation":{"ista":"de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and other planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology, vol. 24, 387–405.","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In Life on Earth and Other Planetary Bodies, 24:387–405. Springer, 2012. https://doi.org/10.1007/978-94-007-4966-5_22.","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405.","ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in Life on Earth and other planetary bodies, vol. 24, Springer, 2012, pp. 387–405.","ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and Other Planetary Bodies. Vol 24. Springer; 2012:387-405. doi:10.1007/978-94-007-4966-5_22","apa":"de Vladar, H., & Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In Life on Earth and other planetary bodies (Vol. 24, pp. 387–405). Springer. https://doi.org/10.1007/978-94-007-4966-5_22","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” Life on Earth and Other Planetary Bodies, vol. 24, Springer, 2012, pp. 387–405, doi:10.1007/978-94-007-4966-5_22."},"status":"public","type":"book_chapter","_id":"3277","date_created":"2018-12-11T12:02:25Z","date_published":"2012-01-01T00:00:00Z","volume":24,"doi":"10.1007/978-94-007-4966-5_22","page":"387 - 405","language":[{"iso":"eng"}],"publication":"Life on Earth and other planetary bodies","day":"01","year":"2012","publication_status":"published","intvolume":" 24","month":"01","publisher":"Springer","alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"quality_controlled":"1","oa_version":"None","abstract":[{"lang":"eng","text":"The problem of the origin of metazoa is becoming more urgent in the context of astrobiology. By now it is clear that clues to the understanding of this crucial transition in the evolution of life can arise in a fourth pathway besides the three possibilities in the quest for simplicity outlined by Bonner in his classical book. In other words, solar system exploration seems to be one way in the long-term to elucidate the simplicity of evolutionary development. We place these ideas in the context of different inheritance systems, namely the genotypic and phenotypic replicators with limited or unlimited heredity, and ask which of these can support multicellular development, and to which degree of complexity. However, the quest for evidence on the evolution of biotas from planets around other stars does not seem to be feasible with present technology with direct visualization of living organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter where there is a possibility of detecting reliable biomarkers in the next decade with the Europa Jupiter System Mission, in view of recent progress by landing micropenetrators on planetary, or satellite surfaces. Mars is a second possibility in the inner Solar System, in spite of the multiple difficulties faced by the fleet of past, present and future missions. We discuss a series of preliminary ideas for elucidating the origin of metazoan analogues with available instrumentation in potential payloads of feasible space missions to the Galilean moons."}]},{"_id":"3279","status":"public","conference":{"name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","end_date":"2012-03-21","start_date":"2012-03-19"},"type":"conference","date_updated":"2021-01-12T07:42:21Z","department":[{"_id":"KrPi"}],"oa_version":"None","abstract":[{"text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n","lang":"eng"}],"intvolume":" 7194","month":"05","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"alternative_title":["LNCS"],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":7194,"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.","short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.","ieee":"A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.","apa":"Jain, A., Pietrzak, K. Z., & Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_21","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:10.1007/978-3-642-28914-9_21","chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_21.","ista":"Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382."},"title":"Hardness preserving constructions of pseudorandom functions","publist_id":"3367","author":[{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"last_name":"Tentes","full_name":"Tentes, Aris","first_name":"Aris"}],"acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","publisher":"Springer","quality_controlled":"1","day":"04","year":"2012","date_created":"2018-12-11T12:02:25Z","date_published":"2012-05-04T00:00:00Z","doi":"10.1007/978-3-642-28914-9_21","page":"369 - 382"},{"status":"public","type":"journal_article","_id":"3274","department":[{"_id":"GaTk"}],"title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","author":[{"id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Rieckh","full_name":"Rieckh, Georg"},{"last_name":"Kreuzer","full_name":"Kreuzer, Wolfgang","first_name":"Wolfgang"},{"first_name":"Holger","full_name":"Waubke, Holger","last_name":"Waubke"},{"full_name":"Balazs, Peter","last_name":"Balazs","first_name":"Peter"}],"publist_id":"3372","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 2012;36(6):960-967. doi:10.1016/j.enganabound.2011.12.014","apa":"Rieckh, G., Kreuzer, W., Waubke, H., & Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. Elsevier. https://doi.org/10.1016/j.enganabound.2011.12.014","ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” Engineering Analysis with Boundary Elements, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” Engineering Analysis with Boundary Elements, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:10.1016/j.enganabound.2011.12.014.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 36(6), 960–967.","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” Engineering Analysis with Boundary Elements. Elsevier, 2012. https://doi.org/10.1016/j.enganabound.2011.12.014."},"date_updated":"2021-01-12T07:42:19Z","intvolume":" 36","month":"06","quality_controlled":"1","publisher":"Elsevier","scopus_import":1,"acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","oa_version":"None","abstract":[{"text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations.","lang":"eng"}],"date_created":"2018-12-11T12:02:24Z","volume":36,"date_published":"2012-06-01T00:00:00Z","issue":"6","doi":"10.1016/j.enganabound.2011.12.014","page":"960 - 967","publication":" Engineering Analysis with Boundary Elements","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2012"},{"author":[{"first_name":"Anna","last_name":"Pereira","full_name":"Pereira, Anna"},{"full_name":"Leite, Flávia","last_name":"Leite","first_name":"Flávia","id":"36705F98-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brasil, Bruno","last_name":"Brasil","first_name":"Bruno"},{"first_name":"Jamaria","last_name":"Soares Martins","full_name":"Soares Martins, Jamaria"},{"first_name":"Alice","full_name":"Torres, Alice","last_name":"Torres"},{"first_name":"Paulo","full_name":"Pimenta, Paulo","last_name":"Pimenta"},{"first_name":"Thais","last_name":"Souto Padrón","full_name":"Souto Padrón, Thais"},{"last_name":"Tranktman","full_name":"Tranktman, Paula","first_name":"Paula"},{"first_name":"Paulo","full_name":"Ferreira, Paulo","last_name":"Ferreira"},{"first_name":"Erna","full_name":"Kroon, Erna","last_name":"Kroon"},{"full_name":"Bonjardim, Cláudio","last_name":"Bonjardim","first_name":"Cláudio"}],"publist_id":"3356","external_id":{"pmid":["22031940"]},"title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","citation":{"short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","ieee":"A. Pereira et al., “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” Journal of Virology, vol. 86, no. 1. ASM, pp. 172–184, 2012.","ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 2012;86(1):172-184. doi:10.1128/JVI.05638-11","apa":"Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta, P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. ASM. https://doi.org/10.1128/JVI.05638-11","mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” Journal of Virology, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:10.1128/JVI.05638-11.","ista":"Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 86(1), 172–184.","chicago":"Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” Journal of Virology. ASM, 2012. https://doi.org/10.1128/JVI.05638-11."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"172 - 184","date_published":"2012-01-01T00:00:00Z","doi":"10.1128/JVI.05638-11","date_created":"2018-12-11T12:02:29Z","year":"2012","day":"01","publication":"Journal of Virology","quality_controlled":"1","publisher":"ASM","oa":1,"acknowledgement":"This work was supported by grants from Fundação de Amparo a Pesquisa do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES), and the National Council for Scientific and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M. were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P., and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A. Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-, and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg, Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD). The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg, Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG, Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for critically reading the manuscript.","department":[{"_id":"JoBo"}],"date_updated":"2021-01-12T07:42:25Z","type":"journal_article","status":"public","_id":"3289","volume":86,"issue":"1","publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/"}],"month":"01","intvolume":" 86","abstract":[{"text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n","lang":"eng"}],"oa_version":"Submitted Version","pmid":1},{"oa":1,"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","page":"1436 - 1444","date_created":"2018-12-11T12:02:36Z","doi":"10.1016/j.patrec.2011.10.007","date_published":"2012-08-01T00:00:00Z","year":"2012","has_accepted_license":"1","publication":"Pattern Recognition Letters","day":"01","publist_id":"3330","author":[{"full_name":"Bendich, Paul","last_name":"Bendich","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cabello, Sergio","last_name":"Cabello","first_name":"Sergio"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"title":"A point calculus for interlevel set homology","citation":{"mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. Pattern Recognition Letters. 2012;33(11):1436-1444. doi:10.1016/j.patrec.2011.10.007","apa":"Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters. Elsevier, 2012. https://doi.org/10.1016/j.patrec.2011.10.007.","ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":" 33","month":"08","abstract":[{"text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology.","lang":"eng"}],"oa_version":"Submitted Version","issue":"11","volume":33,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:15:00Z","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","date_updated":"2020-07-14T12:46:06Z","file_size":280280,"creator":"system","file_id":"5116","checksum":"d65f79775b51258a604ca5ec741297cc","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"type":"journal_article","pubrep_id":"542","status":"public","_id":"3310","file_date_updated":"2020-07-14T12:46:06Z","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:42:34Z","ddc":["000"]},{"title":"Extending the nanocrystal synthesis control to quaternary compositions","article_processing_charge":"No","publist_id":"7488","author":[{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Reza","full_name":"Zamani, Reza","last_name":"Zamani"},{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"first_name":"Alexey","full_name":"Shavel, Alexey","last_name":"Shavel"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:43:05Z","citation":{"ista":"Ibáñez M, Zamani R, Li W, Shavel A, Arbiol J, Morante J, Cabot A. 2012. Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . 12(3), 1085–1090.","chicago":"Ibáñez, Maria, Reza Zamani, Wenhua Li, Alexey Shavel, Jordi Arbiol, Joan Morante, and Andreu Cabot. “Extending the Nanocrystal Synthesis Control to Quaternary Compositions.” Crystal Growth and Design . American Chemical Society (ACS), 2012. https://doi.org/10.1021/cg201709c.","ieee":"M. Ibáñez et al., “Extending the nanocrystal synthesis control to quaternary compositions,” Crystal Growth and Design , vol. 12, no. 3. American Chemical Society (ACS), pp. 1085–1090, 2012.","short":"M. Ibáñez, R. Zamani, W. Li, A. Shavel, J. Arbiol, J. Morante, A. Cabot, Crystal Growth and Design 12 (2012) 1085–1090.","apa":"Ibáñez, M., Zamani, R., Li, W., Shavel, A., Arbiol, J., Morante, J., & Cabot, A. (2012). Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . American Chemical Society (ACS). https://doi.org/10.1021/cg201709c","ama":"Ibáñez M, Zamani R, Li W, et al. Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . 2012;12(3):1085-1090. doi:10.1021/cg201709c","mla":"Ibáñez, Maria, et al. “Extending the Nanocrystal Synthesis Control to Quaternary Compositions.” Crystal Growth and Design , vol. 12, no. 3, American Chemical Society (ACS), 2012, pp. 1085–90, doi:10.1021/cg201709c."},"status":"public","type":"journal_article","article_type":"original","_id":"338","date_created":"2018-12-11T11:45:54Z","doi":"10.1021/cg201709c","issue":"3","date_published":"2012-01-01T00:00:00Z","volume":12,"page":"1085 - 1090","language":[{"iso":"eng"}],"publication":"Crystal Growth and Design ","day":"01","publication_status":"published","year":"2012","intvolume":" 12","month":"01","publisher":"American Chemical Society (ACS)","quality_controlled":"1","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is grateful for financial support through the Ramon y Cajal program of the Spanish MICINN.\r\n\r\n","oa_version":"None","abstract":[{"text":"The ample chemical and structural freedom of quaternary compounds permits engineering materials that fulfill the requirements of a wide variety of applications. In this work, the mechanisms to achieve unprecedented size, shape, and composition control in quaternary nanocrystals are detailed. The described procedure allows obtaining tetrahedral and penta-tetrahedral quaternary nanocrystals with tuned size distributions and controlled compositions from a plethora of I 2-II-IV-VI 4 semiconductors.","lang":"eng"}]},{"citation":{"mla":"Ibáñez, Maria, et al. “Composition Control and Thermoelectric Properties of Quaternary Chalcogenide Nanocrystals: The Case of Stannite Cu2CdSnSe4.” Chemistry of Materials, vol. 24, no. 3, American Chemical Society, 2012, pp. 562–70, doi:10.1021/cm2031812.","short":"M. Ibáñez, D. Cadavid, R. Zamani, N. García Castelló, V. Izquierdo Roca, W. Li, A. Fairbrother, J. Prades, A. Shavel, J. Arbiol, A. Pérez Rodríguez, J. Morante, A. Cabot, Chemistry of Materials 24 (2012) 562–570.","ieee":"M. Ibáñez et al., “Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4,” Chemistry of Materials, vol. 24, no. 3. American Chemical Society, pp. 562–570, 2012.","ama":"Ibáñez M, Cadavid D, Zamani R, et al. Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. 2012;24(3):562-570. doi:10.1021/cm2031812","apa":"Ibáñez, M., Cadavid, D., Zamani, R., García Castelló, N., Izquierdo Roca, V., Li, W., … Cabot, A. (2012). Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm2031812","chicago":"Ibáñez, Maria, Doris Cadavid, Reza Zamani, Nuria García Castelló, Victora Izquierdo Roca, Wenhua Li, Andrew Fairbrother, et al. “Composition Control and Thermoelectric Properties of Quaternary Chalcogenide Nanocrystals: The Case of Stannite Cu2CdSnSe4.” Chemistry of Materials. American Chemical Society, 2012. https://doi.org/10.1021/cm2031812.","ista":"Ibáñez M, Cadavid D, Zamani R, García Castelló N, Izquierdo Roca V, Li W, Fairbrother A, Prades J, Shavel A, Arbiol J, Pérez Rodríguez A, Morante J, Cabot A. 2012. Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. 24(3), 562–570."},"date_updated":"2021-01-12T07:43:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","publist_id":"7489","author":[{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"last_name":"Cadavid","full_name":"Cadavid, Doris","first_name":"Doris"},{"first_name":"Reza","full_name":"Zamani, Reza","last_name":"Zamani"},{"first_name":"Nuria","full_name":"García Castelló, Nuria","last_name":"García Castelló"},{"first_name":"Victora","full_name":"Izquierdo Roca, Victora","last_name":"Izquierdo Roca"},{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"last_name":"Fairbrother","full_name":"Fairbrother, Andrew","first_name":"Andrew"},{"last_name":"Prades","full_name":"Prades, Joan","first_name":"Joan"},{"first_name":"Alexey","full_name":"Shavel, Alexey","last_name":"Shavel"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"full_name":"Pérez Rodríguez, Alejandro","last_name":"Pérez Rodríguez","first_name":"Alejandro"},{"first_name":"Joan","full_name":"Morante, Joan","last_name":"Morante"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"title":"Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4","_id":"339","article_type":"original","type":"journal_article","status":"public","year":"2012","publication_status":"published","publication":"Chemistry of Materials","language":[{"iso":"eng"}],"day":"31","page":"562 - 570","date_created":"2018-12-11T11:45:54Z","date_published":"2012-01-31T00:00:00Z","volume":24,"doi":"10.1021/cm2031812","issue":"3","abstract":[{"lang":"eng","text":"A high-yield and upscalable colloidal synthesis route for the production of quaternary I 2-II-IV-VI 4 nanocrystals, particularly stannite Cu 2+xCd 1-xSnSe 4, with narrow size distribution and precisely controlled composition is presented. It is also shown here how the diversity of valences in the constituent elements allows an effective control of their electrical conductivity through the adjustment of the cation ratios. At the same time, while the crystallographic complexity of quaternary chalcogenides is associated with intrinsically low thermal conductivities, the reduction of the lattice dimensions to the nanoscale further reduces the materials thermal conductivity. In the specific case of the stannite crystal structure, a convenient slab distribution of the valence band maximum states permits a partial decoupling of the p-type electrical conductivity from both the Seebeck coefficient and the thermal conductivity. Combining these features, we demonstrate how an initial optimization of the nanocrystals Cd/Cu ratio allowed us to obtain low-temperature solution-processed materials with ZT values up to 0.71 at 685 K."}],"acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050. and CSD2009-00013. M.I. and N.G.-C. thank the Spanish MICINN for the PhD grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal program of the Spanish MICINN. N.G.-C. and J.D.P. are thankful for the computer resources, technical expertise and assistance provided by the Barcelona Supercomputing Center - Centro Nacional de Supercomputación.","oa_version":"None","publisher":"American Chemical Society","quality_controlled":"1","intvolume":" 24","month":"01"},{"language":[{"iso":"eng"}],"publication":"Journal of the American Chemical Society","day":"02","year":"2012","publication_status":"published","date_created":"2018-12-11T11:45:54Z","date_published":"2012-01-02T00:00:00Z","doi":"10.1021/ja209688a","issue":"3","volume":134,"page":"1438 - 1441","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, CDS2009-00050, CSD2009-00013, and ENE2008-03277-E/CON. M.I. thanks the Spanish MICINN for her Ph.D. grant. A.C. is thankful for financial support through the Ramón y Cajal Program.","oa_version":"None","abstract":[{"text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. ","lang":"eng"}],"intvolume":" 134","month":"01","publisher":"ACS","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:43:13Z","citation":{"mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:10.1021/ja209688a.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., & Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja209688a","ama":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 2012;134(3):1438-1441. doi:10.1021/ja209688a","short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","ieee":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” Journal of the American Chemical Society, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","chicago":"Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja209688a.","ista":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 134(3), 1438–1441."},"title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","article_processing_charge":"No","publist_id":"7490","author":[{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Carrete, Alex","last_name":"Carrete","first_name":"Alex"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"_id":"340","status":"public","type":"journal_article","article_type":"original"},{"month":"12","intvolume":" 14","publisher":"Kluwer","quality_controlled":"1","oa_version":"None","acknowledgement":"Acknowledgments The research was supported by the European Regional Development Funds and the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, MAT2010-21510, CSD2009-00050, and ENE2008-03277-E/CON. M.I. is grateful to the Spanish MIC-INN for her PhD grant. A. Cirera acknowledges support from ICREA Academia program. A. Cabot is grateful to the Spanish MICINN for financial support through the Ramón y Cajal program.","abstract":[{"text":"Nanocomposites are highly promising materials to enhance the efficiency of current thermoelectric devices. A straightforward and at the same time highly versatile and controllable approach to produce nanocomposites is the assembly of solution-processed nanocrystal building blocks. The convenience of this bottom-up approach to produce nanocomposites with homogeneous phase distributions and adjustable composition is demonstrated here by blending Ag2Te and PbTe colloidal nanocrystals to form Ag2Te–PbTe bulk nanocomposites. The thermoelectric properties of these nanocomposites are analyzed in the temperature range from 300 to 700 K. The evolution of their electrical conductivity and Seebeck coefficient is discussed in terms of the blend composition and the characteristics of the constituent materials. ","lang":"eng"}],"volume":14,"issue":"12","date_published":"2012-12-01T00:00:00Z","doi":"10.1007/s11051-012-1328-0","date_created":"2018-12-11T11:45:56Z","day":"01","publication":"Journal of Nanoparticle Research","language":[{"iso":"eng"}],"publication_status":"published","year":"2012","status":"public","type":"journal_article","article_type":"original","_id":"345","title":"Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe","author":[{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"},{"first_name":"Stéphane","last_name":"Gorsse","full_name":"Gorsse, Stéphane"},{"last_name":"López","full_name":"López, Antonio","first_name":"Antonio"},{"last_name":"Cirera","full_name":"Cirera, Albert","first_name":"Albert"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"publist_id":"7485","article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:43:32Z","citation":{"apa":"Cadavid, D., Ibáñez, M., Gorsse, S., López, A., Cirera, A., Morante, J., & Cabot, A. (2012). Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. Kluwer. https://doi.org/10.1007/s11051-012-1328-0","ama":"Cadavid D, Ibáñez M, Gorsse S, et al. Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. 2012;14(12). doi:10.1007/s11051-012-1328-0","ieee":"D. Cadavid et al., “Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe,” Journal of Nanoparticle Research, vol. 14, no. 12. Kluwer, 2012.","short":"D. Cadavid, M. Ibáñez, S. Gorsse, A. López, A. Cirera, J. Morante, A. Cabot, Journal of Nanoparticle Research 14 (2012).","mla":"Cadavid, Doris, et al. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” Journal of Nanoparticle Research, vol. 14, no. 12, Kluwer, 2012, doi:10.1007/s11051-012-1328-0.","ista":"Cadavid D, Ibáñez M, Gorsse S, López A, Cirera A, Morante J, Cabot A. 2012. Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. 14(12).","chicago":"Cadavid, Doris, Maria Ibáñez, Stéphane Gorsse, Antonio López, Albert Cirera, Joan Morante, and Andreu Cabot. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” Journal of Nanoparticle Research. Kluwer, 2012. https://doi.org/10.1007/s11051-012-1328-0."}},{"abstract":[{"lang":"eng","text":"A synthetic route for producing Cu 2ZnGeSe 4 nanocrystals with narrow size distributions and controlled composition is presented. These nanocrystals were used to produce densely packed nanomaterials by hot-pressing. From the characterization of the thermoelectric properties of these nanomaterials, Cu 2ZnGeSe 4 is demonstrated to show excellent thermoelectric properties. A very preliminary adjustment of the nanocrystal composition has already resulted in a figure of merit of up to 0.55 at 450°C. "}],"oa_version":"None","main_file_link":[{"url":"https://authors.library.caltech.edu/30261/","open_access":"1"}],"month":"03","intvolume":" 134","publication_status":"published","language":[{"iso":"eng"}],"issue":"9","volume":134,"_id":"347","article_type":"original","type":"journal_article","status":"public","date_updated":"2021-01-12T07:43:40Z","extern":"1","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. Grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal Program of the Spanish MICINN.","publisher":"ACS","quality_controlled":"1","oa":1,"year":"2012","day":"07","publication":"Journal of the American Chemical Society","page":"4060 - 4063","date_published":"2012-03-07T00:00:00Z","doi":"10.1021/ja211952z","date_created":"2018-12-11T11:45:57Z","citation":{"ista":"Ibáñez M, Zamani R, Lalonde A, Cadavid D, Li W, Shavel A, Arbiol J, Morante J, Gorsse S, Snyder GJ, Cabot A. 2012. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 134(9), 4060–4063.","chicago":"Ibáñez, Maria, Reza Zamani, Aaron Lalonde, Doris Cadavid, Wenhua Li, Alexey Shavel, Jordi Arbiol, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja211952z.","apa":"Ibáñez, M., Zamani, R., Lalonde, A., Cadavid, D., Li, W., Shavel, A., … Cabot, A. (2012). Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja211952z","ama":"Ibáñez M, Zamani R, Lalonde A, et al. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 2012;134(9):4060-4063. doi:10.1021/ja211952z","ieee":"M. Ibáñez et al., “Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties,” Journal of the American Chemical Society, vol. 134, no. 9. ACS, pp. 4060–4063, 2012.","short":"M. Ibáñez, R. Zamani, A. Lalonde, D. Cadavid, W. Li, A. Shavel, J. Arbiol, J. Morante, S. Gorsse, G.J. Snyder, A. Cabot, Journal of the American Chemical Society 134 (2012) 4060–4063.","mla":"Ibáñez, Maria, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” Journal of the American Chemical Society, vol. 134, no. 9, ACS, 2012, pp. 4060–63, doi:10.1021/ja211952z."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"first_name":"Aaron","full_name":"Lalonde, Aaron","last_name":"Lalonde"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"first_name":"Wenhua","full_name":"Li, Wenhua","last_name":"Li"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"last_name":"Morante","full_name":"Morante, Joan","first_name":"Joan"},{"first_name":"Stéphane","last_name":"Gorsse","full_name":"Gorsse, Stéphane"},{"last_name":"Snyder","full_name":"Snyder, G Jeffrey","first_name":"G Jeffrey"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"publist_id":"7487","article_processing_charge":"No","title":"Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Hierarchical Timing Language (HTL) is a coordination language for distributed, hard real-time applications. HTL is a hierarchical extension of Giotto and, like its predecessor, based on the logical execution time (LET) paradigm of real-time programming. Giotto is compiled into code for a virtual machine, called the EmbeddedMachine (or E machine). If HTL is targeted to the E machine, then the hierarchicalprogram structure needs to be flattened; the flattening makes separatecompilation difficult, and may result in E machinecode of exponential size. In this paper, we propose a generalization of the E machine, which supports a hierarchicalprogram structure at runtime through real-time trigger mechanisms that are arranged in a tree. We present the generalized E machine, and a modular compiler for HTL that generates code of linear size. The compiler may generate code for any part of a given HTL program separately in any order."}],"month":"02","intvolume":" 77","scopus_import":1,"quality_controlled":"1","publisher":"Elsevier","day":"01","publication":"Science of Computer Programming","language":[{"iso":"eng"}],"year":"2012","publication_status":"published","doi":"10.1016/j.scico.2010.06.004","date_published":"2012-02-01T00:00:00Z","issue":"2","volume":77,"date_created":"2018-12-11T12:05:26Z","page":"96 - 112","_id":"3836","status":"public","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:32Z","citation":{"mla":"Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:10.1016/j.scico.2010.06.004.","apa":"Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., & Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. Elsevier. https://doi.org/10.1016/j.scico.2010.06.004","ama":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 2012;77(2):96-112. doi:10.1016/j.scico.2010.06.004","short":"A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.","ieee":"A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” Science of Computer Programming, vol. 77, no. 2. Elsevier, pp. 96–112, 2012.","chicago":"Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming. Elsevier, 2012. https://doi.org/10.1016/j.scico.2010.06.004.","ista":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112."},"department":[{"_id":"ToHe"}],"title":"Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code","publist_id":"2370","author":[{"last_name":"Ghosal","full_name":"Ghosal, Arkadeb","first_name":"Arkadeb"},{"first_name":"Daniel","last_name":"Iercan","full_name":"Iercan, Daniel"},{"first_name":"Christoph","full_name":"Kirsch, Christoph","last_name":"Kirsch"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sangiovanni Vincentelli","full_name":"Sangiovanni Vincentelli, Alberto","first_name":"Alberto"}]},{"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2012.07.038","ama":"Chatterjee K, Doyen L. Energy parity games. Theoretical Computer Science. 2012;458:49-60. doi:10.1016/j.tcs.2012.07.038","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458. Elsevier, pp. 49–60, 2012.","short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2012.07.038."},"title":"Energy parity games","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"publist_id":"3736","external_id":{"arxiv":["1001.5183"]},"quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"02","publication":"Theoretical Computer Science","has_accepted_license":"1","year":"2012","date_published":"2012-11-02T00:00:00Z","doi":"10.1016/j.tcs.2012.07.038","date_created":"2018-12-11T12:00:37Z","page":"49 - 60","_id":"2972","status":"public","pubrep_id":"935","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"ddc":["004"],"date_updated":"2023-02-23T11:45:29Z","file_date_updated":"2020-07-14T12:45:57Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.","lang":"eng"}],"month":"11","intvolume":" 458","scopus_import":1,"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5935","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","file_size":351271,"date_updated":"2020-07-14T12:45:57Z","creator":"kschuh","file_name":"2012_Elsevier_Chatterjee.pdf","date_created":"2019-02-06T11:56:22Z"}],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"id":"3851","status":"public","relation":"earlier_version"}]},"volume":458,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1},{"publisher":"ACM","quality_controlled":"1","acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","date_created":"2018-12-11T12:00:36Z","doi":"10.1145/2287718.2287727","date_published":"2012-08-01T00:00:00Z","year":"2012","publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"article_number":"27","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Scott","last_name":"Weinstein","full_name":"Weinstein, Scott"}],"publist_id":"3748","title":"Algorithmic analysis of array-accessing programs","citation":{"mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3, 27, ACM, 2012, doi:10.1145/2287718.2287727.","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 2012;13(3). doi:10.1145/2287718.2287727","apa":"Alur, R., Cerny, P., & Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2287718.2287727","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3. ACM, 2012.","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2287718.2287727.","ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":" 13","month":"08","abstract":[{"text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words.","lang":"eng"}],"oa_version":"None","ec_funded":1,"related_material":{"record":[{"status":"public","id":"4403","relation":"earlier_version"}]},"issue":"3","volume":13,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"2967","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T12:09:43Z"},{"file_date_updated":"2020-07-14T12:46:35Z","date_updated":"2022-08-25T14:59:17Z","ddc":["005","514","516"],"extern":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"946","status":"public","_id":"492","volume":12,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4953","checksum":"0c629e36acd5f2878ff7dd088d67d494","creator":"system","file_size":1691436,"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf","date_created":"2018-12-12T10:12:35Z"}],"scopus_import":"1","intvolume":" 12","month":"07","abstract":[{"lang":"eng","text":"Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis."}],"oa_version":"Published Version","article_processing_charge":"No","publist_id":"7328","author":[{"last_name":"Galkovskyi","full_name":"Galkovskyi, Taras","first_name":"Taras"},{"full_name":"Mileyko, Yuriy","last_name":"Mileyko","first_name":"Yuriy"},{"first_name":"Alexander","full_name":"Bucksch, Alexander","last_name":"Bucksch"},{"first_name":"Brad","full_name":"Moore, Brad","last_name":"Moore"},{"full_name":"Symonova, Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga"},{"first_name":"Charles","full_name":"Price, Charles","last_name":"Price"},{"first_name":"Chrostopher","full_name":"Topp, Chrostopher","last_name":"Topp"},{"first_name":"Anjali","full_name":"Iyer Pascuzzi, Anjali","last_name":"Iyer Pascuzzi"},{"last_name":"Zurek","full_name":"Zurek, Paul","first_name":"Paul"},{"full_name":"Fang, Suqin","last_name":"Fang","first_name":"Suqin"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"last_name":"Benfey","full_name":"Benfey, Philip","first_name":"Philip"},{"full_name":"Weitz, Joshua","last_name":"Weitz","first_name":"Joshua"}],"title":"GiA Roots: Software for the high throughput analysis of plant root system architecture","citation":{"ista":"Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C, Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 12, 116.","chicago":"Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” BMC Plant Biology. BioMed Central, 2012. https://doi.org/10.1186/1471-2229-12-116.","ama":"Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 2012;12. doi:10.1186/1471-2229-12-116","apa":"Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price, C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-12-116","ieee":"T. Galkovskyi et al., “GiA Roots: Software for the high throughput analysis of plant root system architecture,” BMC Plant Biology, vol. 12. BioMed Central, 2012.","short":"T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).","mla":"Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” BMC Plant Biology, vol. 12, 116, BioMed Central, 2012, doi:10.1186/1471-2229-12-116."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_number":"116","date_created":"2018-12-11T11:46:46Z","date_published":"2012-07-26T00:00:00Z","doi":"10.1186/1471-2229-12-116","year":"2012","has_accepted_license":"1","publication":"BMC Plant Biology","day":"26","oa":1,"publisher":"BioMed Central","quality_controlled":"1"},{"citation":{"apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. Frontiers in Neuroscience. Frontiers Research Foundation. https://doi.org/10.3389/fnins.2012.00055","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. Frontiers in Neuroscience. 2012;6. doi:10.3389/fnins.2012.00055","ieee":"M. Tangermann et al., “Review of the BCI competition IV,” Frontiers in Neuroscience, vol. 6. Frontiers Research Foundation, 2012.","short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” Frontiers in Neuroscience, vol. 6, 55, Frontiers Research Foundation, 2012, doi:10.3389/fnins.2012.00055.","ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” Frontiers in Neuroscience. Frontiers Research Foundation, 2012. https://doi.org/10.3389/fnins.2012.00055."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7327","author":[{"last_name":"Tangermann","full_name":"Tangermann, Michael","first_name":"Michael"},{"first_name":"Klaus","full_name":"Müller, Klaus","last_name":"Müller"},{"first_name":"Ad","last_name":"Aertsen","full_name":"Aertsen, Ad"},{"full_name":"Birbaumer, Niels","last_name":"Birbaumer","first_name":"Niels"},{"first_name":"Christoph","full_name":"Braun, Christoph","last_name":"Braun"},{"first_name":"Clemens","full_name":"Brunner, Clemens","last_name":"Brunner"},{"first_name":"Robert","last_name":"Leeb","full_name":"Leeb, Robert"},{"last_name":"Mehring","full_name":"Mehring, Carsten","first_name":"Carsten"},{"last_name":"Miller","full_name":"Miller, Kai","first_name":"Kai"},{"last_name":"Müller Putz","full_name":"Müller Putz, Gernot","first_name":"Gernot"},{"full_name":"Nolte, Guido","last_name":"Nolte","first_name":"Guido"},{"last_name":"Pfurtscheller","full_name":"Pfurtscheller, Gert","first_name":"Gert"},{"full_name":"Preissl, Hubert","last_name":"Preissl","first_name":"Hubert"},{"first_name":"Gerwin","full_name":"Schalk, Gerwin","last_name":"Schalk"},{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl"},{"first_name":"Carmen","full_name":"Vidaurre, Carmen","last_name":"Vidaurre"},{"last_name":"Waldert","full_name":"Waldert, Stephan","first_name":"Stephan"},{"first_name":"Benjamin","full_name":"Blankertz, Benjamin","last_name":"Blankertz"}],"title":"Review of the BCI competition IV","article_number":"55","has_accepted_license":"1","year":"2012","day":"13","publication":"Frontiers in Neuroscience","date_published":"2012-07-13T00:00:00Z","doi":"10.3389/fnins.2012.00055","date_created":"2018-12-11T11:46:46Z","acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","publisher":"Frontiers Research Foundation","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T08:01:03Z","ddc":["004"],"file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"_id":"493","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"945","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"195238221c4b0b0f4035f6f6c16ea17c","file_id":"5356","creator":"system","file_size":2693701,"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","date_created":"2018-12-12T10:18:34Z"}],"language":[{"iso":"eng"}],"volume":6,"abstract":[{"lang":"eng","text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs."}],"oa_version":"Published Version","scopus_import":1,"month":"07","intvolume":" 6"},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","date_created":"2018-12-12T10:15:31Z","file_size":97736,"date_updated":"2020-07-14T12:46:35Z","creator":"system","checksum":"56277f95edc9d531fa3bdc5f9579fda8","file_id":"5152","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"ec_funded":1,"volume":96,"abstract":[{"lang":"eng","text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["EPTCS"],"intvolume":" 96","month":"10","date_updated":"2021-01-12T08:01:04Z","ddc":["004"],"file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"KrCh"}],"_id":"495","conference":{"start_date":"2012-09-06","end_date":"2012-09-08","location":"Napoli, Italy","name":"GandALF: Games, Automata, Logics and Formal Verification"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","pubrep_id":"944","status":"public","year":"2012","has_accepted_license":"1","publication":"Proceedings GandALF 2012","day":"07","page":"238 - 246","date_created":"2018-12-11T11:46:47Z","doi":"10.4204/EPTCS.96.18","date_published":"2012-10-07T00:00:00Z","oa":1,"publisher":"Open Publishing Association","quality_controlled":"1","citation":{"mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18.","apa":"Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: Proceedings GandALF 2012. Vol 96. Open Publishing Association; 2012:238-246. doi:10.4204/EPTCS.96.18","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.","chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In Proceedings GandALF 2012, 96:238–46. Open Publishing Association, 2012. https://doi.org/10.4204/EPTCS.96.18.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kruckman","full_name":"Kruckman, Alex","first_name":"Alex"},{"full_name":"Rubin, Sasha","last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"John","full_name":"Sheridan, John","last_name":"Sheridan"},{"full_name":"Zax, Ben","last_name":"Zax","first_name":"Ben"}],"publist_id":"7325","title":"A Myhill Nerode theorem for automata with advice","project":[{"_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"}]},{"file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"NiBa"}],"ddc":["576"],"date_updated":"2021-01-12T08:01:06Z","status":"public","pubrep_id":"942","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"_id":"498","volume":5,"issue":"8","license":"https://creativecommons.org/licenses/by-nc/4.0/","file":[{"date_created":"2018-12-12T10:10:33Z","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","creator":"system","date_updated":"2020-07-14T12:46:35Z","file_size":396136,"file_id":"4821","checksum":"233007138606aca5a2f75f7ae1742f43","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"12","intvolume":" 5","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration."}],"title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","author":[{"id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","full_name":"Pickup, Melinda","orcid":"0000-0001-6118-0541","last_name":"Pickup"},{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","orcid":"0000-0002-4014-8478","full_name":"Field, David","last_name":"Field"},{"first_name":"David","last_name":"Rowell","full_name":"Rowell, David"},{"full_name":"Young, Andrew","last_name":"Young","first_name":"Andrew"}],"publist_id":"7322","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” Evolutionary Applications, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:10.1111/j.1752-4571.2012.00284.x.","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 2012;5(8):913-924. doi:10.1111/j.1752-4571.2012.00284.x","apa":"Pickup, M., Field, D., Rowell, D., & Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/j.1752-4571.2012.00284.x","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” Evolutionary Applications, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” Evolutionary Applications. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1752-4571.2012.00284.x.","ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924."},"date_published":"2012-12-01T00:00:00Z","doi":"10.1111/j.1752-4571.2012.00284.x","date_created":"2018-12-11T11:46:48Z","page":"913 - 924","day":"01","publication":"Evolutionary Applications","has_accepted_license":"1","year":"2012","publisher":"Wiley-Blackwell","quality_controlled":"1","oa":1,"acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n"},{"quality_controlled":"1","publisher":"IEEE","scopus_import":1,"alternative_title":["LICS"],"main_file_link":[{"open_access":"1","url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf"}],"oa":1,"month":"01","abstract":[{"lang":"eng","text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations."}],"oa_version":"Preprint","date_published":"2012-01-01T00:00:00Z","doi":"10.1109/LICS.2012.65","date_created":"2018-12-11T11:46:47Z","ec_funded":1,"year":"2012","publication_status":"published","day":"01","language":[{"iso":"eng"}],"type":"conference","conference":{"location":"Dubrovnik, Croatia","end_date":"2012-06-28","start_date":"2012-06-25","name":"LICS: Symposium on Logic in Computer Science"},"status":"public","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"_id":"496","article_number":"6280474","publist_id":"7324","author":[{"last_name":"Rabinovich","full_name":"Rabinovich, Alexander","first_name":"Alexander"},{"first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","full_name":"Rubin, Sasha"}],"title":"Interpretations in trees with countably many branches","department":[{"_id":"KrCh"}],"citation":{"chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65.","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.","mla":"Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:10.1109/LICS.2012.65","apa":"Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012."},"date_updated":"2021-01-12T08:01:05Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2018-12-11T11:46:47Z","issue":"4","doi":"10.1145/2362355.2362357","volume":13,"date_published":"2012-10-01T00:00:00Z","publication_status":"published","year":"2012","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"day":"01","scopus_import":1,"quality_controlled":"1","publisher":"ACM","intvolume":" 13","month":"10","abstract":[{"lang":"eng","text":"We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata."}],"oa_version":"None","author":[{"last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publist_id":"7326","department":[{"_id":"ToHe"}],"title":"Translating to Co-Büchi made tight, unified, and useful","date_updated":"2021-01-12T08:01:03Z","citation":{"mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4, 29, ACM, 2012, doi:10.1145/2362355.2362357.","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 2012;13(4). doi:10.1145/2362355.2362357","apa":"Boker, U., & Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2362355.2362357","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4. ACM, 2012.","chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2362355.2362357.","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"494","article_number":"29"},{"publisher":"Rockefeller University Press","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2012","day":"30","publication":"Journal of Cell Biology","page":"347 - 349","date_published":"2012-04-30T00:00:00Z","doi":"10.1083/jcb.201204039","date_created":"2018-12-11T11:46:51Z","citation":{"mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” Journal of Cell Biology, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:10.1083/jcb.201204039.","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” Journal of Cell Biology, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201204039","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 2012;197(3):347-349. doi:10.1083/jcb.201204039","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” Journal of Cell Biology. Rockefeller University Press, 2012. https://doi.org/10.1083/jcb.201204039.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7314","author":[{"last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Cell migration: Fibroblasts find a new way to get ahead","oa_version":"Published Version","scopus_import":1,"month":"04","intvolume":" 197","publication_status":"published","file":[{"creator":"kschuh","date_updated":"2020-07-14T12:46:36Z","file_size":986566,"date_created":"2019-02-12T09:03:09Z","file_name":"2012_CellBiology_Sixt.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","file_id":"5957"}],"language":[{"iso":"eng"}],"issue":"3","volume":197,"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","_id":"506","article_type":"original","type":"journal_article","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"status":"public","date_updated":"2021-01-12T08:01:11Z","ddc":["570"],"file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"MiSi"}]},{"alternative_title":["LIPIcs"],"scopus_import":1,"intvolume":" 16","month":"09","abstract":[{"text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5378"}]},"volume":16,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf","date_created":"2018-12-12T10:08:50Z","creator":"system","file_size":471236,"date_updated":"2020-07-14T12:46:35Z","file_id":"4712","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"conference":{"name":"EACSL: European Association for Computer Science Logic","start_date":"2012-09-03","end_date":"2012-09-06","location":"Fontainebleau, France"},"type":"conference","pubrep_id":"943","status":"public","_id":"497","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:35Z","date_updated":"2023-02-23T12:23:32Z","ddc":["004"],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","page":"167 - 182","date_created":"2018-12-11T11:46:48Z","doi":"10.4230/LIPIcs.CSL.2012.167","date_published":"2012-09-01T00:00:00Z","year":"2012","has_accepted_license":"1","day":"01","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Chaubal, Siddhesh","last_name":"Chaubal","first_name":"Siddhesh"},{"first_name":"Pritish","last_name":"Kamath","full_name":"Kamath, Pritish"}],"publist_id":"7323","title":"Faster algorithms for alternating refinement relations","citation":{"ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:10.4230/LIPIcs.CSL.2012.167","apa":"Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:35Z","pubrep_id":"15","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2012-01-19","location":"Kyoto, Japan","start_date":"2012-01-17"},"type":"conference","_id":"3165","ec_funded":1,"related_material":{"record":[{"relation":"later_version","id":"2141","status":"public"},{"status":"public","id":"5379","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"publication_status":"published","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1109.5018"}],"oa_version":"None","abstract":[{"text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is Õ(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n·m) boundary by presenting a new technique that reduces the running time to O(n 2). This bound also leads to O(n 2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n 3)), and (3) in Markov decision processes (improving for m > n 4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n 2), which is an improvement over earlier bounds for m > n 4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.","lang":"eng"}],"title":"An O(n2) time algorithm for alternating Büchi games","external_id":{"arxiv":["1109.5018"]},"article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"}],"publist_id":"3519","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.","apa":"Chatterjee, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109","ama":"Chatterjee K, Henzinger MH. An O(n2) time algorithm for alternating Büchi games. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2012:1386-1399. doi:10.1137/1.9781611973099.109","short":"K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.","ieee":"K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.","ista":"Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399."},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T12:01:46Z","date_published":"2012-01-01T00:00:00Z","doi":"10.1137/1.9781611973099.109","page":"1386 - 1399","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","year":"2012","oa":1,"quality_controlled":"1","publisher":"SIAM","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award."},{"citation":{"chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.","ista":"Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.","apa":"Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30","ama":"Chatterjee K, Velner Y. Mean payoff pushdown games. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.30","short":"K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ieee":"K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012."},"date_updated":"2023-02-23T12:23:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"publist_id":"3770","title":"Mean payoff pushdown games","department":[{"_id":"KrCh"}],"_id":"2956","article_number":"6280438","conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia ","end_date":"2012-06-28"},"type":"conference","status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"year":"2012","publication_status":"published","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"day":"23","ec_funded":1,"date_created":"2018-12-11T12:00:32Z","related_material":{"record":[{"relation":"earlier_version","id":"5377","status":"public"}]},"date_published":"2012-08-23T00:00:00Z","doi":"10.1109/LICS.2012.30","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and parity objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two-player pushdown games. Finally we also show that all the problems have the same computational complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence (ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.\r\nA Technical Report of this paper is available via internal link.","oa_version":"None","quality_controlled":"1","publisher":"IEEE","scopus_import":1,"month":"08"},{"file_date_updated":"2020-07-14T12:46:38Z","title":"Mean-payoff pushdown games","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"date_updated":"2023-02-23T11:05:50Z","citation":{"apa":"Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002","ama":"Chatterjee K, Velner Y. Mean-Payoff Pushdown Games. IST Austria; 2012. doi:10.15479/AT:IST-2012-0002","short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","ieee":"K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.","mla":"Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.","ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002."},"status":"public","pubrep_id":"10","type":"technical_report","_id":"5377","doi":"10.15479/AT:IST-2012-0002","related_material":{"record":[{"relation":"later_version","status":"public","id":"2956"}]},"date_published":"2012-07-02T00:00:00Z","date_created":"2018-12-12T11:38:59Z","page":"33","day":"02","file":[{"file_id":"5522","checksum":"a03c08c1589dbb0c96183a8bcf3ab240","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-002_IST-2012-0002.pdf","date_created":"2018-12-12T11:54:00Z","creator":"system","file_size":592098,"date_updated":"2020-07-14T12:46:38Z"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2012","month":"07","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded."}]},{"ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0001.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster Algorithms for Alternating Refinement Relations. IST Austria; 2012. doi:10.15479/AT:IST-2012-0001","apa":"Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012."},"date_updated":"2023-02-23T12:21:38Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:39Z","title":"Faster algorithms for alternating refinement relations","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Chaubal, Siddhesh","last_name":"Chaubal","first_name":"Siddhesh"},{"last_name":"Kamath","full_name":"Kamath, Pritish","first_name":"Pritish"}],"_id":"5378","status":"public","pubrep_id":"14","type":"technical_report","day":"04","file":[{"date_updated":"2020-07-14T12:46:39Z","file_size":394256,"creator":"system","date_created":"2018-12-12T11:53:28Z","file_name":"IST-2012-0001_IST-2012-0001.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5489","checksum":"ec8d1857cc7095d3de5107a0162ced37"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2012","related_material":{"record":[{"relation":"later_version","id":"497","status":"public"}]},"date_published":"2012-07-04T00:00:00Z","doi":"10.15479/AT:IST-2012-0001","date_created":"2018-12-12T11:38:59Z","page":"21","oa_version":"Published Version","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm."}],"month":"07","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1},{"quality_controlled":"1","publisher":"IEEE","oa":1,"acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","doi":"10.1109/LICS.2012.28","date_published":"2012-08-23T00:00:00Z","date_created":"2018-12-11T12:00:32Z","day":"23","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","year":"2012","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_number":"6280436","title":"Partial-observation stochastic games: How to win when belief fails","publist_id":"3771","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"external_id":{"arxiv":["1107.2141"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.28","apa":"Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.","ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28."},"month":"08","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","id":"2211","status":"public"},{"relation":"earlier_version","status":"public","id":"5381"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia","end_date":"2012-06-28"},"_id":"2955","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:43Z"},{"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:46Z","type":"conference","conference":{"start_date":"2012-03-24","location":"Tallinn, Estonia","end_date":"2012-04-01","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"status":"public","_id":"3341","related_material":{"record":[{"status":"public","id":"5382","relation":"earlier_version"}]},"volume":7213,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1107.2009","open_access":"1"}],"month":"03","intvolume":" 7213","abstract":[{"text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal).","lang":"eng"}],"oa_version":"Preprint","publist_id":"3284","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"external_id":{"arxiv":["1107.2009"]},"title":"Robustness of structurally equivalent concurrent parity games","citation":{"ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. https://doi.org/10.1007/978-3-642-28729-9_18.","short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:10.1007/978-3-642-28729-9_18","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18","mla":"Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"270 - 285","doi":"10.1007/978-3-642-28729-9_18","date_published":"2012-03-22T00:00:00Z","date_created":"2018-12-11T12:02:46Z","year":"2012","day":"22","publisher":"Springer","quality_controlled":"1","oa":1},{"citation":{"short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ieee":"K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.","ama":"Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.29","apa":"Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.","ista":"Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.29."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1107.2091"]},"publist_id":"3769","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","full_name":"Tracol, Mathieu","last_name":"Tracol"}],"title":"Decidable problems for probabilistic automata on infinite words","article_number":"6280437","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"year":"2012","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"23","date_created":"2018-12-11T12:00:33Z","doi":"10.1109/LICS.2012.29","date_published":"2012-08-23T00:00:00Z","oa":1,"publisher":"IEEE","quality_controlled":"1","date_updated":"2023-02-23T12:23:51Z","department":[{"_id":"KrCh"}],"_id":"2957","conference":{"name":"LICS: Logic in Computer Science","end_date":"2012-06-28","location":"Dubrovnik, Croatia ","start_date":"2012-06-25"},"type":"conference","status":"public","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"5384","relation":"earlier_version"}]},"abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1107.2091","open_access":"1"}],"scopus_import":1,"month":"08"},{"type":"journal_article","pubrep_id":"42","status":"public","_id":"3249","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T12:24:04Z","scopus_import":1,"intvolume":" 413","month":"01","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of "fit" or "desirability". We extend the simulation preorder to the quantitative setting by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"oa_version":"None","ec_funded":1,"issue":"1","related_material":{"record":[{"status":"public","id":"4393","relation":"earlier_version"},{"id":"5389","status":"public","relation":"earlier_version"}]},"volume":413,"publication_status":"published","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"publist_id":"3408","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"title":"Simulation distances","citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. Theoretical Computer Science. 2012;413(1):21-35. doi:10.1016/j.tcs.2011.08.002","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.08.002","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.","mla":"Cerny, Pavol, et al. “Simulation Distances.” Theoretical Computer Science, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:10.1016/j.tcs.2011.08.002.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.08.002."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","quality_controlled":"1","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), the European Union project COMBEST and the European Network of Excellence Artist Design.","page":"21 - 35","date_created":"2018-12-11T12:02:15Z","doi":"10.1016/j.tcs.2011.08.002","date_published":"2012-01-06T00:00:00Z","year":"2012","publication":"Theoretical Computer Science","day":"06"},{"abstract":[{"text":"We consider the problem of inference in a graphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pairwise terms over a discretized domain. This allows the use of techniques originally developed for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it from training data. Experimental results show that for certain types of graphs a learned function can outperform the Bethe approximation. We also establish a link between the Bethe free energy and submodular functions.\r\n","lang":"eng"}],"oa_version":"Submitted Version","alternative_title":["Inferning 2012"],"publisher":"ICML","quality_controlled":"1","oa":1,"month":"06","has_accepted_license":"1","year":"2012","publication_status":"published","file":[{"file_name":"IST-2016-565-v1+1_DM-inferning2012.pdf","date_created":"2018-12-12T10:11:34Z","file_size":305836,"date_updated":"2020-07-14T12:46:00Z","creator":"system","checksum":"3d0d4246548c736857302aadb2ff5d15","file_id":"4889","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"day":"30","language":[{"iso":"eng"}],"date_published":"2012-06-30T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"5396","status":"public"}]},"date_created":"2018-12-11T12:01:31Z","_id":"3124","type":"conference","conference":{"end_date":"2012-07-01","location":"Edinburgh, Scotland","start_date":"2012-06-26","name":"ICML: International Conference on Machine Learning"},"status":"public","pubrep_id":"565","citation":{"mla":"Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.","ama":"Korc F, Kolmogorov V, Lampert C. Approximating marginals using discrete energy minimization. In: ICML; 2012.","apa":"Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals using discrete energy minimization. Presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland: ICML.","short":"F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.","ieee":"F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. “Approximating Marginals Using Discrete Energy Minimization.” ICML, 2012.","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, ."},"date_updated":"2023-02-23T12:24:24Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"publist_id":"3575","author":[{"full_name":"Korc, Filip","last_name":"Korc","id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Filip"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"department":[{"_id":"ChLa"},{"_id":"VlKo"}],"title":"Approximating marginals using discrete energy minimization","file_date_updated":"2020-07-14T12:46:00Z"},{"_id":"5396","type":"technical_report","pubrep_id":"36","status":"public","date_updated":"2023-02-23T11:13:22Z","citation":{"ieee":"F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.","short":"F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.","apa":"Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals using discrete energy minimization. IST Austria. https://doi.org/10.15479/AT:IST-2012-0003","ama":"Korc F, Kolmogorov V, Lampert C. Approximating Marginals Using Discrete Energy Minimization. IST Austria; 2012. doi:10.15479/AT:IST-2012-0003","mla":"Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0003."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Filip","full_name":"Korc, Filip","last_name":"Korc"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"file_date_updated":"2020-07-14T12:46:44Z","title":"Approximating marginals using discrete energy minimization","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it from training data. Experimental results show that for certain types of graphs a learned function can out-perform the Bethe approximation. We also establish a link between the Bethe free energy and submodular functions."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"07","publication_status":"published","year":"2012","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"23","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5490","checksum":"7e0ba85ad123b13223aaf6cdde2d288c","file_size":618744,"date_updated":"2020-07-14T12:46:44Z","creator":"system","file_name":"IST-2012-0003_IST-2012-0003.pdf","date_created":"2018-12-12T11:53:29Z"}],"page":"13","date_created":"2018-12-12T11:39:06Z","related_material":{"record":[{"id":"3124","status":"public","relation":"earlier_version"}]},"date_published":"2012-07-23T00:00:00Z","doi":"10.15479/AT:IST-2012-0003"},{"date_created":"2018-12-12T11:39:06Z","date_published":"2012-11-12T00:00:00Z","publication_status":"published","year":"2012","has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":238544,"date_updated":"2020-07-14T12:46:44Z","file_name":"IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf","date_created":"2018-12-12T11:53:11Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5472","checksum":"e0a7c041eea1ca4b70ab6f9ec5177f4e"}],"day":"12","oa":1,"publisher":"IST Austria","month":"11","abstract":[{"text":"This document is created as a part of the project “Repository for Research Data on IST Austria”. It summarises the actual state of research data at IST Austria, based on survey results. It supports the choice of appropriate software, which would best fit the requirements of their users, the researchers.","lang":"eng"}],"oa_version":"Published Version","author":[{"full_name":"Porsche, Jana","last_name":"Porsche","first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:46:44Z","title":"Actual state of research data @ ISTAustria","date_updated":"2020-07-14T23:04:49Z","citation":{"ista":"Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p.","chicago":"Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012.","ama":"Porsche J. Actual State of Research Data @ ISTAustria. IST Austria; 2012.","apa":"Porsche, J. (2012). Actual state of research data @ ISTAustria. IST Austria.","ieee":"J. Porsche, Actual state of research data @ ISTAustria. IST Austria, 2012.","short":"J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.","mla":"Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"type":"report","pubrep_id":"103","status":"public","_id":"5398"},{"file_date_updated":"2020-07-14T12:47:12Z","extern":"1","ddc":["000"],"date_updated":"2021-01-12T08:03:43Z","status":"public","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"5839","volume":4,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5863","checksum":"ba0185986b151d8c11201f48cd505ceb","date_updated":"2020-07-14T12:47:12Z","file_size":305426,"creator":"dernst","date_created":"2019-01-21T07:28:06Z","file_name":"2012_Procedia_Biswas.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2212-0173"]},"publication_status":"published","month":"05","intvolume":" 4","oa_version":"Published Version","abstract":[{"text":"Canny's edge detection algorithm is a classical and robust method for edge detection in gray-scale images. The two \r\nsignificant features of this method are introduction of NMS (Non-Maximum Suppression) and double thresholding of \r\nthe gradient image. Due to poor illumination, the region boundaries in an image may become vague, creating \r\nuncertainties in the gradient image. In this paper, we have proposed an algorithm based on the concept of type-2 fuzzy sets to handle uncertainties that automatically selects the threshold values needed to segment the gradient image using classical Canny’s edge detection algorithm. The results show that our algorithm works significantly well on different benchmark images as well as medical images (hand radiography images). ","lang":"eng"}],"title":"An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"first_name":"Jaya","full_name":"Sil, Jaya","last_name":"Sil"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” Procedia Technology, vol. 4, Elsevier, 2012, pp. 820–24, doi:10.1016/j.protcy.2012.05.134.","apa":"Biswas, R., & Sil, J. (2012). An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. Elsevier. https://doi.org/10.1016/j.protcy.2012.05.134","ama":"Biswas R, Sil J. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 2012;4:820-824. doi:10.1016/j.protcy.2012.05.134","short":"R. Biswas, J. Sil, Procedia Technology 4 (2012) 820–824.","ieee":"R. Biswas and J. Sil, “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets,” Procedia Technology, vol. 4. Elsevier, pp. 820–824, 2012.","chicago":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” Procedia Technology. Elsevier, 2012. https://doi.org/10.1016/j.protcy.2012.05.134.","ista":"Biswas R, Sil J. 2012. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 4, 820–824."},"date_published":"2012-05-01T00:00:00Z","doi":"10.1016/j.protcy.2012.05.134","date_created":"2019-01-17T11:54:21Z","page":"820-824","day":"01","publication":"Procedia Technology","has_accepted_license":"1","year":"2012","quality_controlled":"1","publisher":"Elsevier","oa":1},{"publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4582759/"}],"oa":1,"month":"04","intvolume":" 417","abstract":[{"text":"The human Mediator complex controls RNA polymerase II (pol II) function in ways that remain incompletely understood. Activator-Mediator binding alters Mediator structure, and these activator-induced structural shifts appear to play key roles in regulating transcription. A recent cryo-electron microscopy (EM) analysis revealed that pol II adopted a stable orientation within a Mediator-pol II-TFIIF assembly in which Mediator was bound to the activation domain of viral protein 16 (VP16). Whereas TFIIF was shown to be important for orienting pol II within this assembly, the potential role of the activator was not assessed. To determine how activator binding might affect pol II orientation, we isolated human Mediator-pol II-TFIIF complexes in which Mediator was not bound to an activator. Cryo-EM analysis of this assembly, coupled with pol II crystal structure docking, revealed that pol II binds Mediator at the same general location; however, in contrast to VP16-bound Mediator, pol II does not appear to stably orient in the absence of an activator. Variability in pol II orientation might be important mechanistically, perhaps to enable sense and antisense transcription at human promoters. Because Mediator interacts extensively with pol II, these results suggest that Mediator structural shifts induced by activator binding help stably orient pol II prior to transcription initiation.","lang":"eng"}],"oa_version":"None","page":"387 - 394","issue":"5","volume":417,"doi":"10.1016/j.jmb.2012.02.014","date_published":"2012-04-13T00:00:00Z","date_created":"2018-12-11T11:47:24Z","publication_status":"published","year":"2012","day":"13","language":[{"iso":"eng"}],"publication":"Journal of Molecular Biology","type":"journal_article","status":"public","_id":"596","author":[{"last_name":"Bernecky","orcid":"0000-0003-0893-7036","full_name":"Bernecky, Carrie A","first_name":"Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dylan","last_name":"Taatjes","full_name":"Taatjes, Dylan"}],"publist_id":"7208","article_processing_charge":"No","title":"Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly","citation":{"short":"C. Bernecky, D. Taatjes, Journal of Molecular Biology 417 (2012) 387–394.","ieee":"C. Bernecky and D. Taatjes, “Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly,” Journal of Molecular Biology, vol. 417, no. 5. Elsevier, pp. 387–394, 2012.","ama":"Bernecky C, Taatjes D. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. 2012;417(5):387-394. doi:10.1016/j.jmb.2012.02.014","apa":"Bernecky, C., & Taatjes, D. (2012). Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2012.02.014","mla":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” Journal of Molecular Biology, vol. 417, no. 5, Elsevier, 2012, pp. 387–94, doi:10.1016/j.jmb.2012.02.014.","ista":"Bernecky C, Taatjes D. 2012. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. 417(5), 387–394.","chicago":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” Journal of Molecular Biology. Elsevier, 2012. https://doi.org/10.1016/j.jmb.2012.02.014."},"date_updated":"2021-01-12T08:05:21Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Busch KE, Laurent P, Soltesz Z, et al. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. 2012;15(4):581-591. doi:10.1038/nn.3061","apa":"Busch, K. E., Laurent, P., Soltesz, Z., Murphy, R. J., Faivre, O., Hedwig, B., … de Bono, M. (2012). Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/nn.3061","short":"K.E. Busch, P. Laurent, Z. Soltesz, R.J. Murphy, O. Faivre, B. Hedwig, M. Thomas, H.L. Smith, M. de Bono, Nature Neuroscience 15 (2012) 581–591.","ieee":"K. E. Busch et al., “Tonic signaling from O2 sensors sets neural circuit activity and behavioral state,” Nature Neuroscience, vol. 15, no. 4. Springer Nature, pp. 581–591, 2012.","mla":"Busch, Karl Emanuel, et al. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” Nature Neuroscience, vol. 15, no. 4, Springer Nature, 2012, pp. 581–91, doi:10.1038/nn.3061.","ista":"Busch KE, Laurent P, Soltesz Z, Murphy RJ, Faivre O, Hedwig B, Thomas M, Smith HL, de Bono M. 2012. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. 15(4), 581–591.","chicago":"Busch, Karl Emanuel, Patrick Laurent, Zoltan Soltesz, Robin Joseph Murphy, Olivier Faivre, Berthold Hedwig, Martin Thomas, Heather L Smith, and Mario de Bono. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” Nature Neuroscience. Springer Nature, 2012. https://doi.org/10.1038/nn.3061."},"title":"Tonic signaling from O2 sensors sets neural circuit activity and behavioral state","external_id":{"pmid":["22388961"]},"author":[{"last_name":"Busch","full_name":"Busch, Karl Emanuel","first_name":"Karl Emanuel"},{"last_name":"Laurent","full_name":"Laurent, Patrick","first_name":"Patrick"},{"first_name":"Zoltan","full_name":"Soltesz, Zoltan","last_name":"Soltesz"},{"first_name":"Robin Joseph","last_name":"Murphy","full_name":"Murphy, Robin Joseph"},{"first_name":"Olivier","full_name":"Faivre, Olivier","last_name":"Faivre"},{"last_name":"Hedwig","full_name":"Hedwig, Berthold","first_name":"Berthold"},{"first_name":"Martin","full_name":"Thomas, Martin","last_name":"Thomas"},{"last_name":"Smith","full_name":"Smith, Heather L","first_name":"Heather L"},{"last_name":"de Bono","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"Nature Neuroscience","day":"04","year":"2012","date_created":"2019-03-20T14:23:30Z","doi":"10.1038/nn.3061","date_published":"2012-03-04T00:00:00Z","page":"581-591","_id":"6136","status":"public","type":"journal_article","extern":"1","date_updated":"2021-01-12T08:06:17Z","oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"Tonic receptors convey stimulus duration and intensity and are implicated in homeostatic control. However, how tonic homeostatic signals are generated and how they reconfigure neural circuits and modify animal behavior is poorly understood. Here we show that Caenorhabditis elegans O2-sensing neurons are tonic receptors that continuously signal ambient [O2] to set the animal's behavioral state. Sustained signaling relied on a Ca2+ relay involving L-type voltage-gated Ca2+ channels, the ryanodine and the inositol-1,4,5-trisphosphate receptors. Tonic activity evoked continuous neuropeptide release, which helps elicit the enduring behavioral state associated with high [O2]. Sustained O2 receptor signaling was propagated to downstream neural circuits, including the hub interneuron RMG. O2 receptors evoked similar locomotory states at particular O2 concentrations, regardless of previous d[O2]/dt. However, a phasic component of the URX receptors' response to high d[O2]/dt, as well as tonic-to-phasic transformations in downstream interneurons, enabled transient reorientation movements shaped by d[O2]/dt. Our results highlight how tonic homeostatic signals can generate both transient and enduring behavioral change.","lang":"eng"}],"intvolume":" 15","month":"03","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3564487/","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1097-6256","1546-1726"]},"issue":"4","volume":15},{"oa_version":"None","abstract":[{"lang":"eng","text":"This paper proposes a novel cooperative approach for two-hop amplify-and-forward (A&F) relaying that exploits both the signal forwarded by the relay and the one directly transmitted by the source in impulse-radio ultra-wideband (IR-UWB) systems. Specifically, we focus on a non-coherent setup employing a double-differential encoding scheme at the source node and a single differential demodulation at the relay and destination. The log-likelihood ratio based decision rule is derived at the destination node. A semi-analytical power allocation strategy is presented by evaluating a closed-form expression for the effective signal to noise ratio (SNR) at the destination, which is maximized by exhaustive search. Numerical simulations show that the proposed system outperforms both the direct transmission with single differential encoding and the non-cooperative multi-hop approach in different scenarios."}],"month":"07","publisher":"IEEE","quality_controlled":"1","day":"31","publication":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1520-6149"]},"publication_status":"published","year":"2012","doi":"10.1109/icassp.2012.6288524","date_published":"2012-07-31T00:00:00Z","date_created":"2019-07-31T09:14:48Z","page":"2905-2908","_id":"6746","status":"public","type":"conference","conference":{"name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing","start_date":"2012-03-25","location":"Kyoto, Japan","end_date":"2012-03-30"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:08:49Z","citation":{"ama":"Mondelli M, Zhou Q, Ma X, Lottici V. A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE; 2012:2905-2908. doi:10.1109/icassp.2012.6288524","apa":"Mondelli, M., Zhou, Q., Ma, X., & Lottici, V. (2012). A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. In 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (pp. 2905–2908). Kyoto, Japan: IEEE. https://doi.org/10.1109/icassp.2012.6288524","short":"M. Mondelli, Q. Zhou, X. Ma, V. Lottici, in:, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2012, pp. 2905–2908.","ieee":"M. Mondelli, Q. Zhou, X. Ma, and V. Lottici, “A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems,” in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 2012, pp. 2905–2908.","mla":"Mondelli, Marco, et al. “A Cooperative Approach for Amplify-and-Forward Differential Transmitted Reference IR-UWB Relay Systems.” 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2012, pp. 2905–08, doi:10.1109/icassp.2012.6288524.","ista":"Mondelli M, Zhou Q, Ma X, Lottici V. 2012. A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). ICASSP: International Conference on Acoustics, Speech and Signal Processing, 2905–2908.","chicago":"Mondelli, Marco, Qi Zhou, Xiaoli Ma, and Vincenzo Lottici. “A Cooperative Approach for Amplify-and-Forward Differential Transmitted Reference IR-UWB Relay Systems.” In 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2905–8. IEEE, 2012. https://doi.org/10.1109/icassp.2012.6288524."},"title":"A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems","author":[{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Zhou","full_name":"Zhou, Qi","first_name":"Qi"},{"full_name":"Ma, Xiaoli","last_name":"Ma","first_name":"Xiaoli"},{"first_name":"Vincenzo","full_name":"Lottici, Vincenzo","last_name":"Lottici"}]},{"day":"01","language":[{"iso":"eng"}],"publication":"Journal of Materials Science","publication_identifier":{"issn":["0022-2461"],"eissn":["1573-4803"]},"publication_status":"published","year":"2012","date_published":"2012-08-01T00:00:00Z","issue":"15","doi":"10.1007/s10853-012-6463-6","volume":47,"date_created":"2019-11-19T13:36:54Z","page":"5729-5734","oa_version":"None","abstract":[{"lang":"eng","text":"The Seebeck coefficients, electrical resistivities, total thermal conductivities, and magnetization are reported for temperatures between 5 and 350 K for n-type Bi0.88Sb0.12 nano-composite alloys made by Ho-doping at the 0, 1, and 3 % atomic levels. The alloys were prepared using a dc hot-pressing method, and are shown to be single phase for both Ho contents with grain sizes on the average of 900 nm. We find the parent compound has a maximum of ZT = 0.28 at 231 K, while doping 1 % Ho increases the maximum ZT to 0.31 at 221 K and the 3 % doped sample suppresses the maximum ZT = 0.24 at a temperature of 260 K."}],"month":"08","intvolume":" 47","publisher":"Springer Nature","quality_controlled":"1","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Lukas, K. C., Joshi, G., Modic, K. A., Ren, Z. F., & Opeil, C. P. (2012). Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. Springer Nature. https://doi.org/10.1007/s10853-012-6463-6","ama":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. 2012;47(15):5729-5734. doi:10.1007/s10853-012-6463-6","short":"K.C. Lukas, G. Joshi, K.A. Modic, Z.F. Ren, C.P. Opeil, Journal of Materials Science 47 (2012) 5729–5734.","ieee":"K. C. Lukas, G. Joshi, K. A. Modic, Z. F. Ren, and C. P. Opeil, “Thermoelectric properties of Ho-doped Bi0.88Sb0.12,” Journal of Materials Science, vol. 47, no. 15. Springer Nature, pp. 5729–5734, 2012.","mla":"Lukas, K. C., et al. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” Journal of Materials Science, vol. 47, no. 15, Springer Nature, 2012, pp. 5729–34, doi:10.1007/s10853-012-6463-6.","ista":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. 2012. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. 47(15), 5729–5734.","chicago":"Lukas, K. C., G. Joshi, Kimberly A Modic, Z. F. Ren, and C. P. Opeil. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” Journal of Materials Science. Springer Nature, 2012. https://doi.org/10.1007/s10853-012-6463-6."},"date_updated":"2021-01-12T08:11:43Z","title":"Thermoelectric properties of Ho-doped Bi0.88Sb0.12","author":[{"full_name":"Lukas, K. C.","last_name":"Lukas","first_name":"K. C."},{"first_name":"G.","full_name":"Joshi, G.","last_name":"Joshi"},{"orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","last_name":"Modic","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"first_name":"Z. F.","full_name":"Ren, Z. F.","last_name":"Ren"},{"first_name":"C. P.","last_name":"Opeil","full_name":"Opeil, C. P."}],"article_processing_charge":"No","_id":"7074","status":"public","type":"journal_article","article_type":"original"},{"status":"public","type":"journal_article","article_type":"original","_id":"7308","title":"The carbon electrode in nonaqueous Li–O2 cells","author":[{"first_name":"Muhammed M.","full_name":"Ottakam Thotiyl, Muhammed M.","last_name":"Ottakam Thotiyl"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319"},{"full_name":"Peng, Zhangquan","last_name":"Peng","first_name":"Zhangquan"},{"first_name":"Peter G.","full_name":"Bruce, Peter G.","last_name":"Bruce"}],"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ottakam Thotiyl, Muhammed M., et al. “The Carbon Electrode in Nonaqueous Li–O2 Cells.” Journal of the American Chemical Society, vol. 135, no. 1, ACS, 2012, pp. 494–500, doi:10.1021/ja310258x.","ieee":"M. M. Ottakam Thotiyl, S. A. Freunberger, Z. Peng, and P. G. Bruce, “The carbon electrode in nonaqueous Li–O2 cells,” Journal of the American Chemical Society, vol. 135, no. 1. ACS, pp. 494–500, 2012.","short":"M.M. Ottakam Thotiyl, S.A. Freunberger, Z. Peng, P.G. Bruce, Journal of the American Chemical Society 135 (2012) 494–500.","ama":"Ottakam Thotiyl MM, Freunberger SA, Peng Z, Bruce PG. The carbon electrode in nonaqueous Li–O2 cells. Journal of the American Chemical Society. 2012;135(1):494-500. doi:10.1021/ja310258x","apa":"Ottakam Thotiyl, M. M., Freunberger, S. A., Peng, Z., & Bruce, P. G. (2012). The carbon electrode in nonaqueous Li–O2 cells. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja310258x","chicago":"Ottakam Thotiyl, Muhammed M., Stefan Alexander Freunberger, Zhangquan Peng, and Peter G. Bruce. “The Carbon Electrode in Nonaqueous Li–O2 Cells.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja310258x.","ista":"Ottakam Thotiyl MM, Freunberger SA, Peng Z, Bruce PG. 2012. The carbon electrode in nonaqueous Li–O2 cells. Journal of the American Chemical Society. 135(1), 494–500."},"date_updated":"2021-01-12T08:12:56Z","month":"11","intvolume":" 135","publisher":"ACS","quality_controlled":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Carbon has been used widely as the basis of porous cathodes for nonaqueous Li–O2 cells. However, the stability of carbon and the effect of carbon on electrolyte decomposition in such cells are complex and depend on the hydrophobicity/hydrophilicity of the carbon surface. Analyzing carbon cathodes, cycled in Li–O2 cells between 2 and 4 V, using acid treatment and Fenton’s reagent, and combined with differential electrochemical mass spectrometry and FTIR, demonstrates the following: Carbon is relatively stable below 3.5 V (vs Li/Li+) on discharge or charge, especially so for hydrophobic carbon, but is unstable on charging above 3.5 V (in the presence of Li2O2), oxidatively decomposing to form Li2CO3. Direct chemical reaction with Li2O2 accounts for only a small proportion of the total carbon decomposition on cycling. Carbon promotes electrolyte decomposition during discharge and charge in a Li–O2 cell, giving rise to Li2CO3 and Li carboxylates (DMSO and tetraglyme electrolytes). The Li2CO3 and Li carboxylates present at the end of discharge and those that form on charge result in polarization on the subsequent charge. Li2CO3 (derived from carbon and from the electrolyte) as well as the Li carboxylates (derived from the electrolyte) decompose and form on charging. Oxidation of Li2CO3 on charging to ∼4 V is incomplete; Li2CO3 accumulates on cycling resulting in electrode passivation and capacity fading. Hydrophilic carbon is less stable and more catalytically active toward electrolyte decomposition than carbon with a hydrophobic surface. If the Li–O2 cell could be charged at or below 3.5 V, then carbon may be relatively stable, however, its ability to promote electrolyte decomposition, presenting problems for its use in a practical Li–O2 battery. The results emphasize that stable cycling of Li2O2 at the cathode in a Li–O2 cell depends on the synergy between electrolyte and electrode; the stability of the electrode and the electrolyte cannot be considered in isolation."}],"date_published":"2012-11-28T00:00:00Z","issue":"1","volume":135,"doi":"10.1021/ja310258x","date_created":"2020-01-15T12:18:57Z","page":"494-500","day":"28","publication":"Journal of the American Chemical Society","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0002-7863","1520-5126"]},"year":"2012","publication_status":"published"},{"status":"public","article_type":"original","type":"journal_article","_id":"7309","title":"Challenges facing Lithium batteries and electrical double-layer capacitors","author":[{"first_name":"Nam-Soon","last_name":"Choi","full_name":"Choi, Nam-Soon"},{"last_name":"Chen","full_name":"Chen, Zonghai","first_name":"Zonghai"},{"last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"},{"last_name":"Ji","full_name":"Ji, Xiulei","first_name":"Xiulei"},{"last_name":"Sun","full_name":"Sun, Yang-Kook","first_name":"Yang-Kook"},{"last_name":"Amine","full_name":"Amine, Khalil","first_name":"Khalil"},{"first_name":"Gleb","last_name":"Yushin","full_name":"Yushin, Gleb"},{"last_name":"Nazar","full_name":"Nazar, Linda F.","first_name":"Linda F."},{"first_name":"Jaephil","last_name":"Cho","full_name":"Cho, Jaephil"},{"last_name":"Bruce","full_name":"Bruce, Peter G.","first_name":"Peter G."}],"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Choi N-S, Chen Z, Freunberger SA, Ji X, Sun Y-K, Amine K, Yushin G, Nazar LF, Cho J, Bruce PG. 2012. Challenges facing Lithium batteries and electrical double-layer capacitors. Angewandte Chemie International Edition. 51(40), 9994–10024.","chicago":"Choi, Nam-Soon, Zonghai Chen, Stefan Alexander Freunberger, Xiulei Ji, Yang-Kook Sun, Khalil Amine, Gleb Yushin, Linda F. Nazar, Jaephil Cho, and Peter G. Bruce. “Challenges Facing Lithium Batteries and Electrical Double-Layer Capacitors.” Angewandte Chemie International Edition. Wiley, 2012. https://doi.org/10.1002/anie.201201429.","apa":"Choi, N.-S., Chen, Z., Freunberger, S. A., Ji, X., Sun, Y.-K., Amine, K., … Bruce, P. G. (2012). Challenges facing Lithium batteries and electrical double-layer capacitors. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201201429","ama":"Choi N-S, Chen Z, Freunberger SA, et al. Challenges facing Lithium batteries and electrical double-layer capacitors. Angewandte Chemie International Edition. 2012;51(40):9994-10024. doi:10.1002/anie.201201429","short":"N.-S. Choi, Z. Chen, S.A. Freunberger, X. Ji, Y.-K. Sun, K. Amine, G. Yushin, L.F. Nazar, J. Cho, P.G. Bruce, Angewandte Chemie International Edition 51 (2012) 9994–10024.","ieee":"N.-S. Choi et al., “Challenges facing Lithium batteries and electrical double-layer capacitors,” Angewandte Chemie International Edition, vol. 51, no. 40. Wiley, pp. 9994–10024, 2012.","mla":"Choi, Nam-Soon, et al. “Challenges Facing Lithium Batteries and Electrical Double-Layer Capacitors.” Angewandte Chemie International Edition, vol. 51, no. 40, Wiley, 2012, pp. 9994–10024, doi:10.1002/anie.201201429."},"date_updated":"2021-01-12T08:12:56Z","month":"10","intvolume":" 51","publisher":"Wiley","quality_controlled":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Energy‐storage technologies, including electrical double‐layer capacitors and rechargeable batteries, have attracted significant attention for applications in portable electronic devices, electric vehicles, bulk electricity storage at power stations, and “load leveling” of renewable sources, such as solar energy and wind power. Transforming lithium batteries and electric double‐layer capacitors requires a step change in the science underpinning these devices, including the discovery of new materials, new electrochemistry, and an increased understanding of the processes on which the devices depend. The Review will consider some of the current scientific issues underpinning lithium batteries and electric double‐layer capacitors."}],"date_published":"2012-10-01T00:00:00Z","issue":"40","volume":51,"doi":"10.1002/anie.201201429","date_created":"2020-01-15T12:19:11Z","page":"9994-10024","day":"01","publication":"Angewandte Chemie International Edition","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1433-7851"]},"publication_status":"published","year":"2012"},{"_id":"7310","type":"journal_article","article_type":"original","status":"public","citation":{"chicago":"Peng, Z., Stefan Alexander Freunberger, Y. Chen, and P. G. Bruce. “A Reversible and Higher-Rate Li-O2 Battery.” Science. AAAS, 2012. https://doi.org/10.1126/science.1223985.","ista":"Peng Z, Freunberger SA, Chen Y, Bruce PG. 2012. A reversible and higher-rate Li-O2 battery. Science. 337(6094), 563–566.","mla":"Peng, Z., et al. “A Reversible and Higher-Rate Li-O2 Battery.” Science, vol. 337, no. 6094, AAAS, 2012, pp. 563–66, doi:10.1126/science.1223985.","ieee":"Z. Peng, S. A. Freunberger, Y. Chen, and P. G. Bruce, “A reversible and higher-rate Li-O2 battery,” Science, vol. 337, no. 6094. AAAS, pp. 563–566, 2012.","short":"Z. Peng, S.A. Freunberger, Y. Chen, P.G. Bruce, Science 337 (2012) 563–566.","apa":"Peng, Z., Freunberger, S. A., Chen, Y., & Bruce, P. G. (2012). A reversible and higher-rate Li-O2 battery. Science. AAAS. https://doi.org/10.1126/science.1223985","ama":"Peng Z, Freunberger SA, Chen Y, Bruce PG. A reversible and higher-rate Li-O2 battery. Science. 2012;337(6094):563-566. doi:10.1126/science.1223985"},"date_updated":"2021-01-12T08:12:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"full_name":"Peng, Z.","last_name":"Peng","first_name":"Z."},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander"},{"first_name":"Y.","last_name":"Chen","full_name":"Chen, Y."},{"first_name":"P. G.","full_name":"Bruce, P. G.","last_name":"Bruce"}],"title":"A reversible and higher-rate Li-O2 battery","abstract":[{"text":"The rechargeable nonaqueous lithium-air (Li-O2) battery is receiving a great deal of interest because, theoretically, its specific energy far exceeds the best that can be achieved with lithium-ion cells. Operation of the rechargeable Li-O2 battery depends critically on repeated and highly reversible formation/decomposition of lithium peroxide (Li2O2) at the cathode upon cycling. Here, we show that this process is possible with the use of a dimethyl sulfoxide electrolyte and a porous gold electrode (95% capacity retention from cycles 1 to 100), whereas previously only partial Li2O2 formation/decomposition and limited cycling could occur. Furthermore, we present data indicating that the kinetics of Li2O2 oxidation on charge is approximately 10 times faster than on carbon electrodes.","lang":"eng"}],"oa_version":"None","quality_controlled":"1","publisher":"AAAS","intvolume":" 337","month":"08","year":"2012","publication_status":"published","publication_identifier":{"issn":["0036-8075","1095-9203"]},"language":[{"iso":"eng"}],"publication":"Science","day":"03","page":"563-566","date_created":"2020-01-15T12:19:23Z","issue":"6094","volume":337,"date_published":"2012-08-03T00:00:00Z","doi":"10.1126/science.1223985"},{"_id":"7311","status":"public","type":"journal_article","article_type":"original","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. 2012. Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. 134(18), 7952–7957.","chicago":"Chen, Yuhui, Stefan Alexander Freunberger, Zhangquan Peng, Fanny Bardé, and Peter G. Bruce. “Li–O2 Battery with a Dimethylformamide Electrolyte.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja302178w.","apa":"Chen, Y., Freunberger, S. A., Peng, Z., Bardé, F., & Bruce, P. G. (2012). Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja302178w","ama":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. 2012;134(18):7952-7957. doi:10.1021/ja302178w","short":"Y. Chen, S.A. Freunberger, Z. Peng, F. Bardé, P.G. Bruce, Journal of the American Chemical Society 134 (2012) 7952–7957.","ieee":"Y. Chen, S. A. Freunberger, Z. Peng, F. Bardé, and P. G. Bruce, “Li–O2 battery with a dimethylformamide electrolyte,” Journal of the American Chemical Society, vol. 134, no. 18. ACS, pp. 7952–7957, 2012.","mla":"Chen, Yuhui, et al. “Li–O2 Battery with a Dimethylformamide Electrolyte.” Journal of the American Chemical Society, vol. 134, no. 18, ACS, 2012, pp. 7952–57, doi:10.1021/ja302178w."},"date_updated":"2021-01-12T08:12:58Z","title":"Li–O2 battery with a dimethylformamide electrolyte","author":[{"first_name":"Yuhui","last_name":"Chen","full_name":"Chen, Yuhui"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319"},{"full_name":"Peng, Zhangquan","last_name":"Peng","first_name":"Zhangquan"},{"first_name":"Fanny","full_name":"Bardé, Fanny","last_name":"Bardé"},{"full_name":"Bruce, Peter G.","last_name":"Bruce","first_name":"Peter G."}],"article_processing_charge":"No","oa_version":"None","abstract":[{"lang":"eng","text":"Stability of the electrolyte toward reduced oxygen species generated at the cathode is a crucial challenge for the rechargeable nonaqueous Li–O2 battery. Here, we investigate dimethylformamide as the basis of an electrolyte. Although reactions at the O2 cathode on the first discharge–charge cycle are dominated by reversible Li2O2 formation/decomposition, there is also electrolyte decomposition, which increases on cycling. The products of decomposition at the cathode on discharge are Li2O2, Li2CO3, HCO2Li, CH3CO2Li, NO, H2O, and CO2. Li2CO3 accumulates in the electrode with cycling. The stability of dimethylformamide toward reduced oxygen species is insufficient for its use in the rechargeable nonaqueous Li–O2 battery."}],"month":"04","intvolume":" 134","quality_controlled":"1","publisher":"ACS","day":"19","publication":"Journal of the American Chemical Society","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0002-7863","1520-5126"]},"year":"2012","publication_status":"published","issue":"18","volume":134,"doi":"10.1021/ja302178w","date_published":"2012-04-19T00:00:00Z","date_created":"2020-01-15T12:19:36Z","page":"7952-7957"},{"month":"01","publisher":"ACM","oa_version":"None","abstract":[{"text":"Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whether one could compose algorithms that perform efficiently under different conditions, so that the composition preserves the performance of the original components when their conditions are met. In this paper, we evaluate the cost of composing shared-memory algorithms. First, we formally define the notion of safely composable algorithms and we show that every sequential type has a safely composable implementation, as long as enough state is transferred between modules. Since such generic implementations are inherently expensive, we present a more general light-weight specification that allows the designer to transfer very little state between modules, by taking advantage of the semantics of the implemented object. Using this framework, we implement a composed longlived test-and-set object, with the property that each of its modules is asymptotically optimal with respect to the progress condition it ensures, while the entire implementation only uses objects with consensus number at most two. Thus, we show that the overhead of composition can be negligible in the case of some important shared-memory abstractions.","lang":"eng"}],"doi":"10.1145/2312005.2312057","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:48:22Z","page":"298 - 307","day":"01","language":[{"iso":"eng"}],"year":"2012","publication_status":"published","status":"public","type":"conference","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"_id":"762","title":"On the cost of composing shared-memory algorithms","author":[{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Guerraoui","full_name":"Guerraoui, Rachid","first_name":"Rachid"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"},{"last_name":"Losa","full_name":"Losa, Giuliano","first_name":"Giuliano"}],"publist_id":"6892","article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T13:12:27Z","citation":{"ista":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. 2012. On the cost of composing shared-memory algorithms. SPAA: Symposium on Parallelism in Algorithms and Architectures, 298–307.","chicago":"Alistarh, Dan-Adrian, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. “On the Cost of Composing Shared-Memory Algorithms,” 298–307. ACM, 2012. https://doi.org/10.1145/2312005.2312057.","ama":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. On the cost of composing shared-memory algorithms. In: ACM; 2012:298-307. doi:10.1145/2312005.2312057","apa":"Alistarh, D.-A., Guerraoui, R., Kuznetsov, P., & Losa, G. (2012). On the cost of composing shared-memory algorithms (pp. 298–307). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2312005.2312057","ieee":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, and G. Losa, “On the cost of composing shared-memory algorithms,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2012, pp. 298–307.","short":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, G. Losa, in:, ACM, 2012, pp. 298–307.","mla":"Alistarh, Dan-Adrian, et al. On the Cost of Composing Shared-Memory Algorithms. ACM, 2012, pp. 298–307, doi:10.1145/2312005.2312057."}},{"oa_version":"None","acknowledgement":"Hagit Attiya - Supported in party by Israel Science Foundation (grant number 1227/10).\r\nCorentin Travers - Additional supports from the ANR projects ALADDIN and DISPLEXITY\r\n","abstract":[{"text":"Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in constant time if the number of failures f is limited to O(√n), while for general f ≤ n - 1 renaming can always be solved in O(log f) communication rounds. In the wait-free case, i.e. for f = n - 1, our upper bounds match the Ω(log n) lower bound of Chaudhuri et al. [13].","lang":"eng"}],"month":"01","publisher":"Springer","alternative_title":["LNCS"],"day":"01","language":[{"iso":"eng"}],"publication_status":"published","year":"2012","doi":"10.1007/978-3-642-31104-8_17","volume":"7355 LNCS","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:48:22Z","page":"195 - 206","_id":"763","status":"public","type":"conference","conference":{"name":"SIROCCO: Structural Information and Communication Complexity"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T13:12:41Z","citation":{"chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. https://doi.org/10.1007/978-3-642-31104-8_17.","ista":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. 2012. Early deciding synchronous renaming in O(log f) rounds or less. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 7355 LNCS, 195–206.","mla":"Alistarh, Dan-Adrian, et al. Early Deciding Synchronous Renaming in O(Log f) Rounds or Less. Vol. 7355 LNCS, Springer, 2012, pp. 195–206, doi:10.1007/978-3-642-31104-8_17.","ama":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. Early deciding synchronous renaming in O(log f) rounds or less. In: Vol 7355 LNCS. Springer; 2012:195-206. doi:10.1007/978-3-642-31104-8_17","apa":"Alistarh, D.-A., Attiya, H., Guerraoui, R., & Travers, C. (2012). Early deciding synchronous renaming in O(log f) rounds or less (Vol. 7355 LNCS, pp. 195–206). Presented at the SIROCCO: Structural Information and Communication Complexity, Springer. https://doi.org/10.1007/978-3-642-31104-8_17","ieee":"D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.","short":"D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 195–206."},"title":"Early deciding synchronous renaming in O(log f) rounds or less","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Attiya","full_name":"Attiya, Hagit","first_name":"Hagit"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"publist_id":"6893","article_processing_charge":"No"},{"title":"Of choices, failures and asynchrony: the many faces of set agreement","article_processing_charge":"No","publist_id":"6894","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"first_name":"Corentin","full_name":"Travers, Corentin","last_name":"Travers"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York), vol. 62, no. 1–2, Springer, 2012, pp. 595–629, doi:10.1007/s00453-011-9581-7.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Algorithmica (New York) 62 (2012) 595–629.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” Algorithmica (New York), vol. 62, no. 1–2. Springer, pp. 595–629, 2012.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 2012;62(1-2):595-629. doi:10.1007/s00453-011-9581-7","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2012). Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). Springer. https://doi.org/10.1007/s00453-011-9581-7","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York). Springer, 2012. https://doi.org/10.1007/s00453-011-9581-7.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 62(1–2), 595–629."},"date_updated":"2023-02-23T13:13:02Z","status":"public","type":"journal_article","_id":"764","date_created":"2018-12-11T11:48:23Z","issue":"1-2","volume":62,"date_published":"2012-02-01T00:00:00Z","doi":"10.1007/s00453-011-9581-7","page":"595 - 629","publication":"Algorithmica (New York)","language":[{"iso":"eng"}],"day":"01","year":"2012","publication_status":"published","intvolume":" 62","month":"02","publisher":"Springer","acknowledgement":"We would like to thank Hagit Attiya, Keren Censor-Hillel, and the anonymous\r\nreviewers for their feedback on drafts of this paper.\r\nPart of the work was performed as C. Travers was a Post-Doctoral Fellow at the Technion, Haifa,\r\nsupported by the “Sam & Cecilia Neaman” Fellowship. Part of the work was performed as S. Gilbert was\r\na Post-Doctoral Fellow at the Swiss Federal Institute of Technology, Lausanne, Switzerland.","oa_version":"None","abstract":[{"lang":"eng","text":"Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. In synchronous networks, too, the complexity of set agreement has been a significant research challenge that has now been resolved. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony. Nothing specific is known about the complexity of set agreement in such a "partially synchronous" setting. In this paper, we address this challenge, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in a fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone message-passing system in which some fragments appear synchronous to some processes. We use this simulation technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. Specifically, we show that every set agreement protocol requires at least $\\lfloor\\frac t k \\rfloor + 2$ synchronous rounds to decide. We present an (asymptotically) matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony. From these two results, we derive the size of the minimal window of synchrony needed to solve set agreement. By relating synchronous, asynchronous and partially synchronous environments, our simulation technique is of independent interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of Gafni et al. (in SIAM J. Comput. 40(1):63-78, 2011), and to re-derive the combinatorial topology lower bound of Guerraoui et al. (in Theor. Comput. Sci. 410(6-7):570-580, 2009) in an algorithmic way."}]},{"article_processing_charge":"No","publist_id":"6890","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Michael","last_name":"Bender","full_name":"Bender, Michael"},{"full_name":"Gilbert, Seth","last_name":"Gilbert","first_name":"Seth"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"}],"title":"How to allocate tasks asynchronously","date_updated":"2023-02-23T13:13:27Z","citation":{"ama":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. How to allocate tasks asynchronously. In: IEEE; 2012:331-340. doi:10.1109/FOCS.2012.41","apa":"Alistarh, D.-A., Bender, M., Gilbert, S., & Guerraoui, R. (2012). How to allocate tasks asynchronously (pp. 331–340). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2012.41","ieee":"D.-A. Alistarh, M. Bender, S. Gilbert, and R. Guerraoui, “How to allocate tasks asynchronously,” presented at the FOCS: Foundations of Computer Science, 2012, pp. 331–340.","short":"D.-A. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, in:, IEEE, 2012, pp. 331–340.","mla":"Alistarh, Dan-Adrian, et al. How to Allocate Tasks Asynchronously. IEEE, 2012, pp. 331–40, doi:10.1109/FOCS.2012.41.","ista":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. 2012. How to allocate tasks asynchronously. FOCS: Foundations of Computer Science, 331–340.","chicago":"Alistarh, Dan-Adrian, Michael Bender, Seth Gilbert, and Rachid Guerraoui. “How to Allocate Tasks Asynchronously,” 331–40. IEEE, 2012. https://doi.org/10.1109/FOCS.2012.41."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","conference":{"name":"FOCS: Foundations of Computer Science"},"type":"conference","status":"public","_id":"766","page":"331 - 340","date_created":"2018-12-11T11:48:23Z","doi":"10.1109/FOCS.2012.41","date_published":"2012-01-01T00:00:00Z","year":"2012","publication_status":"published","language":[{"iso":"eng"}],"day":"01","publisher":"IEEE","month":"01","abstract":[{"lang":"eng","text":"Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key building block for various distributed algorithms. In this paper, we break new ground on this classic problem: we introduce the To-Do Tree concurrent data structure, which improves on the best known randomized and deterministic upper bounds. In the presence of an adaptive adversary, the randomized To-Do Tree algorithm has O(m + p log p log2 m) work complexity. We then show that there exists a deterministic variant of the To-Do Tree algorithm with work complexity O(m + p log5 m log2 max(m, p)). For all values of m and p, our algorithms are within log factors of the Ω(m + p log p) lower bound for this problem. The key technical ingredient in our results is a new approach for analyzing concurrent executions against a strong adaptive scheduler. This technique allows us to handle the complex dependencies between the processes' coin flips and their scheduling, and to tightly bound the work needed to perform subsets of the tasks."}],"oa_version":"None"}]