--- _id: '3113' 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. author: - first_name: Alexandre full_name: Martinière, Alexandre last_name: Martinière - first_name: Irene full_name: Lavagi, Irene last_name: Lavagi - first_name: Gayathri full_name: Nageswaran, Gayathri last_name: Nageswaran - first_name: Daniel full_name: Rolfe, Daniel J last_name: Rolfe - first_name: Lilly full_name: Maneta-Peyret, Lilly last_name: Maneta Peyret - first_name: Doan full_name: Luu, Doan-Trung last_name: Luu - first_name: Stanley full_name: Botchway, Stanley W last_name: Botchway - first_name: Stephen full_name: Webb, Stephen E last_name: Webb - first_name: Sebastien full_name: Mongrand, Sebastien last_name: Mongrand - first_name: Christophe full_name: Maurel, Christophe last_name: Maurel - first_name: Marisa full_name: Martin-Fernandez, Marisa L last_name: Martin Fernandez - first_name: Jürgen full_name: Kleine-Vehn, Jürgen last_name: Kleine Vehn - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Patrick full_name: Moreau, Patrick last_name: Moreau - first_name: John full_name: Runions, John last_name: Runions citation: 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 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 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. 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. 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. 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. 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. date_created: 2018-12-11T12:01:28Z date_published: 2012-07-31T00:00:00Z date_updated: 2021-01-12T07:41:09Z day: '31' doi: 10.1073/pnas.1202040109 extern: 1 intvolume: ' 109' issue: '31' month: '07' page: 12805 - 12810 publication: PNAS publication_status: published publisher: National Academy of Sciences publist_id: '3586' quality_controlled: 0 status: public title: Cell wall constrains lateral diffusion of plant plasma membrane proteins type: journal_article volume: 109 year: '2012' ... --- _id: '3114' 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 full_name: Ding, Zhaojun last_name: Ding - first_name: Bangjun full_name: Wang, Bangjun last_name: Wang - first_name: Ignacio full_name: Moreno, Ignacio last_name: Moreno - first_name: Nikoleta full_name: Dupláková, Nikoleta last_name: Dupláková - first_name: Sibu full_name: Sibu Simon id: 4542EF9A-F248-11E8-B48F-1D18A9856A87 last_name: Simon orcid: 0000-0002-1998-6741 - first_name: Nicola full_name: Carraro, Nicola last_name: Carraro - first_name: Jesica full_name: Reemmer, Jesica last_name: Reemmer - first_name: Aleš full_name: Pěnčík, Aleš last_name: Pěnčík - first_name: Xu full_name: Xu Chen id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Ricardo full_name: Tejos, Ricardo I last_name: Tejos - first_name: Petr full_name: Skůpa, Petr last_name: Skůpa - first_name: Stephan full_name: Pollmann, Stephan last_name: Pollmann - first_name: Jozef full_name: Mravec, Jozef last_name: Mravec - first_name: Jan full_name: Petrášek, Jan last_name: Petrášek - first_name: Eva full_name: Zažímalová, Eva last_name: Zažímalová - first_name: David full_name: Honys, David last_name: Honys - first_name: Jakub full_name: Rolčík, Jakub last_name: Rolčík - first_name: Angus full_name: Murphy, Angus S last_name: Murphy - first_name: Ariel full_name: Orellana, Ariel last_name: Orellana - first_name: Markus full_name: Geisler, Markus last_name: Geisler - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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). date_created: 2018-12-11T12:01:28Z date_published: 2012-07-03T00:00:00Z date_updated: 2021-01-12T07:41:09Z day: '03' doi: 10.1038/ncomms1941 extern: 1 intvolume: ' 3' issue: AN 941 month: '07' publication: Nature Communications publication_status: published publisher: Nature Publishing Group publist_id: '3585' quality_controlled: 0 status: public title: ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis type: journal_article volume: 3 year: '2012' ... --- _id: '3111' abstract: - lang: eng 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. author: - first_name: Deshu full_name: Lin, Deshu last_name: Lin - first_name: Shingo full_name: Nagawa, Shingo last_name: Nagawa - first_name: Jisheng full_name: Chen, Jisheng last_name: Chen - first_name: Lingyan full_name: Cao, Lingyan last_name: Cao - first_name: Xu full_name: Xu Chen id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Tongda full_name: Xu, Tongda last_name: Xu - first_name: Hongjiang full_name: Hongjiang Li id: 33CA54A6-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0001-5039-9660 - first_name: Pankaj full_name: Dhonukshe, Pankaj last_name: Dhonukshe - first_name: Chizuko full_name: Yamamuro, Chizuko last_name: Yamamuro - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Ben full_name: Scheres, Ben last_name: Scheres - first_name: Ying full_name: Fu, Ying last_name: Fu - first_name: Zhenbiao full_name: Yang, Zhenbiao last_name: Yang citation: 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 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. 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. 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. 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. 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. date_created: 2018-12-11T12:01:27Z date_published: 2012-07-24T00:00:00Z date_updated: 2021-01-12T07:41:08Z day: '24' doi: 10.1016/j.cub.2012.05.019 extern: 1 intvolume: ' 22' issue: '14' month: '07' page: 1319 - 1325 publication: Current Biology publication_status: published publisher: Cell Press publist_id: '3588' quality_controlled: 0 status: public title: A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots type: journal_article volume: 22 year: '2012' ... --- _id: '3112' 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. author: - first_name: Xu full_name: Xu Chen id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Satoshi full_name: Naramoto, Satoshi last_name: Naramoto - first_name: Stéphanie full_name: Robert, Stéphanie last_name: Robert - first_name: Ricardo full_name: Tejos, Ricardo last_name: Tejos - first_name: Christian full_name: Löfke, Christian last_name: Löfke - first_name: Deshu full_name: Lin, Deshu last_name: Lin - first_name: Zhenbiao full_name: Yang, Zhenbiao last_name: Yang - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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_created: 2018-12-11T12:01:27Z date_published: 2012-07-24T00:00:00Z date_updated: 2021-01-12T07:41:08Z day: '24' doi: 10.1016/j.cub.2012.05.020 extern: 1 intvolume: ' 22' issue: '14' month: '07' page: 1326 - 1332 publication: Current Biology publication_status: published publisher: Cell Press publist_id: '3587' quality_controlled: 0 status: public title: ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots type: journal_article volume: 22 year: '2012' ... --- _id: '3128' abstract: - lang: eng 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). ' 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).' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: Chatterjee K, 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 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. 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. 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. 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. short: K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284. date_created: 2018-12-11T12:01:33Z date_published: 2012-10-01T00:00:00Z date_updated: 2021-01-12T07:41:15Z day: '01' ddc: - '005' department: - _id: KrCh - _id: ToHe doi: 10.1007/s10703-012-0164-2 ec_funded: 1 file: - access_level: open_access checksum: dd3d590f383bb2ac6cfda1489ac1c42a content_type: application/pdf creator: system date_created: 2018-12-12T10:11:27Z date_updated: 2020-07-14T12:46:00Z file_id: '4882' file_name: IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf file_size: 163983 relation: main_file file_date_updated: 2020-07-14T12:46:00Z has_accepted_license: '1' intvolume: ' 43' issue: '2' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 268 - 284 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Formal Methods in System Design publication_status: published publisher: Springer publist_id: '3570' pubrep_id: '303' quality_controlled: '1' scopus_import: 1 status: public title: A survey of partial-observation stochastic parity games type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2012' ... --- _id: '3125' 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. alternative_title: - LNCS article_processing_charge: No author: - first_name: Viktoriia full_name: Sharmanska, Viktoriia id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87 last_name: Sharmanska orcid: 0000-0003-0192-9308 - first_name: Novi full_name: Quadrianto, Novi last_name: Quadrianto - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Sharmanska V, Quadrianto N, Lampert C. 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' 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. 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.' ista: 'Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations. ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 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. short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255. conference: end_date: 2012-10-13 location: Florence, Italy name: 'ECCV: European Conference on Computer Vision' start_date: 2012-10-07 date_created: 2018-12-11T12:01:32Z date_published: 2012-10-01T00:00:00Z date_updated: 2023-02-23T11:13:25Z day: '01' ddc: - '000' department: - _id: ChLa doi: 10.1007/978-3-642-33715-4_18 file: - access_level: open_access checksum: bccdbe0663780d25a1e0524002b2d896 content_type: application/pdf creator: dernst date_created: 2020-05-15T12:29:04Z date_updated: 2020-07-14T12:46:00Z file_id: '7861' file_name: 2012_ECCV_Sharmanska.pdf file_size: 6073897 relation: main_file file_date_updated: 2020-07-14T12:46:00Z has_accepted_license: '1' intvolume: ' 7576' issue: PART 5 language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 242 - 255 publication_status: published publisher: Springer publist_id: '3574' quality_controlled: '1' scopus_import: 1 status: public title: Augmented attribute representations type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7576 year: '2012' ... --- _id: '3129' 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" alternative_title: - LNCS author: - first_name: Oleksiy full_name: Busaryev, Oleksiy last_name: Busaryev - first_name: Sergio full_name: Cabello, Sergio last_name: Cabello - first_name: Chao full_name: Chen, Chao id: 3E92416E-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Tamal full_name: Dey, Tamal last_name: Dey - first_name: Yusu full_name: Wang, Yusu last_name: Wang citation: 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' 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. 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.' 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.' 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. short: O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200. conference: end_date: 2012-07-06 location: Helsinki, Finland name: 'SWAT: Symposium and Workshops on Algorithm Theory' start_date: 2012-07-04 date_created: 2018-12-11T12:01:33Z date_published: 2012-06-19T00:00:00Z date_updated: 2021-01-12T07:41:15Z day: '19' department: - _id: HeEd doi: 10.1007/978-3-642-31155-0_17 external_id: arxiv: - '1107.3793' intvolume: ' 7357' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.3793 month: '06' oa: 1 oa_version: Preprint page: 189 - 200 publication_status: published publisher: Springer publist_id: '3569' quality_controlled: '1' scopus_import: 1 status: public title: Annotating simplices with a homology basis and its applications type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7357 year: '2012' ... --- _id: '3126' abstract: - lang: eng 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" alternative_title: - LNCS author: - first_name: Andreas full_name: Müller, Andreas last_name: Müller - first_name: Sebastian full_name: Nowozin, Sebastian last_name: Nowozin - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: 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' 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' 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. 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.' 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.' 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. short: A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215. conference: end_date: 2012-08-31 location: Graz, Austria name: 'DAGM: German Association For Pattern Recognition' start_date: 2012-08-28 date_created: 2018-12-11T12:01:32Z date_published: 2012-08-14T00:00:00Z date_updated: 2021-01-12T07:41:14Z day: '14' department: - _id: ChLa doi: 10.1007/978-3-642-32717-9_21 intvolume: ' 7476' language: - iso: eng month: '08' oa_version: None page: 205 - 215 publication_status: published publisher: Springer publist_id: '3573' quality_controlled: '1' scopus_import: 1 status: public title: Information theoretic clustering using minimal spanning trees type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7476 year: '2012' ... --- _id: '3155' abstract: - lang: eng 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.' acknowledgement: Research partially supported by the Danish-Chinese Center for Cyber Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB. alternative_title: - LNCS author: - first_name: Benoît full_name: Delahaye, Benoît last_name: Delahaye - first_name: Uli full_name: Fahrenberg, Uli last_name: Fahrenberg - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Axel full_name: Legay, Axel last_name: Legay - first_name: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic citation: 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' 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. 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.' 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. short: B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218. conference: end_date: 2012-06-16 location: Stockholm, Sweden name: 'FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems ' start_date: 2012-06-13 date_created: 2018-12-11T12:01:43Z date_published: 2012-06-01T00:00:00Z date_updated: 2021-01-12T07:41:26Z day: '01' ddc: - '004' department: - _id: ToHe doi: 10.1007/978-3-642-30793-5_13 file: - access_level: open_access checksum: feae2e07f2d9a59843f8ddabf25d179f content_type: application/pdf creator: system date_created: 2018-12-12T10:11:25Z date_updated: 2020-07-14T12:46:01Z file_id: '4879' file_name: IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf file_size: 493198 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 7273' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 203 - 218 publication_status: published publisher: Springer publist_id: '3539' pubrep_id: '88' quality_controlled: '1' scopus_import: 1 status: public title: Synchronous interface theories and time triggered scheduling type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7273 year: '2012' ... --- _id: '3159' 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. 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." article_number: e36715 author: - first_name: Yuriy full_name: Mileyko, Yuriy last_name: Mileyko - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Charles full_name: Price, Charles last_name: Price - first_name: Joshua full_name: Weitz, Joshua last_name: Weitz citation: 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. 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. ista: Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715. 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). date_created: 2018-12-11T12:01:44Z date_published: 2012-06-06T00:00:00Z date_updated: 2021-01-12T07:41:28Z day: '06' ddc: - '510' department: - _id: HeEd doi: 10.1371/journal.pone.0036715 file: - access_level: open_access checksum: 515a98ad72e470752f03f13663dcaff8 content_type: application/pdf creator: kschuh date_created: 2019-02-05T12:38:43Z date_updated: 2020-07-14T12:46:01Z file_id: '5922' file_name: 2012_PLoS_Mileyko.PDF file_size: 541583 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 7' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '3530' pubrep_id: '385' quality_controlled: '1' scopus_import: 1 status: public title: Hierarchical ordering of reticular networks tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2012' ... --- _id: '3156' 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." author: - first_name: Line V full_name: Ugelvig, Line V id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87 last_name: Ugelvig orcid: 0000-0003-1832-8883 - first_name: Anne full_name: Andersen, Anne last_name: Andersen - first_name: Jacobus full_name: Boomsma, Jacobus last_name: Boomsma - first_name: David full_name: Nash, David last_name: Nash citation: 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 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 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. 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. 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. 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. short: L.V. Ugelvig, A. Andersen, J. Boomsma, D. Nash, Molecular Ecology 21 (2012) 3224–3236. date_created: 2018-12-11T12:01:43Z date_published: 2012-07-01T00:00:00Z date_updated: 2021-01-12T07:41:27Z day: '01' department: - _id: SyCr doi: 10.1111/j.1365-294X.2012.05592.x intvolume: ' 21' issue: '13' language: - iso: eng month: '07' oa_version: None page: 3224 - 3236 publication: Molecular Ecology publication_status: published publisher: Wiley-Blackwell publist_id: '3538' quality_controlled: '1' scopus_import: 1 status: public title: Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2012' ... --- _id: '3158' abstract: - lang: eng 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. author: - first_name: Hannah full_name: Schachtner, Hannah last_name: Schachtner - first_name: Ang full_name: Li, Ang last_name: Li - first_name: David full_name: Stevenson, David last_name: Stevenson - first_name: Simon full_name: Calaminus, Simon last_name: Calaminus - first_name: Steven full_name: Thomas, Steven last_name: Thomas - first_name: Steve full_name: Watson, Steve last_name: Watson - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Roland full_name: Wedlich Söldner, Roland last_name: Wedlich Söldner - first_name: Douglas full_name: Strathdee, Douglas last_name: Strathdee - first_name: Laura full_name: Machesky, Laura last_name: Machesky citation: 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 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 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. 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. 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. 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. 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. date_created: 2018-12-11T12:01:44Z date_published: 2012-11-01T00:00:00Z date_updated: 2021-01-12T07:41:27Z day: '01' department: - _id: MiSi doi: 10.1016/j.ejcb.2012.04.002 external_id: pmid: - '22658956' intvolume: ' 91' issue: 11-12 language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3930012/ month: '11' oa: 1 oa_version: Submitted Version page: 923 - 929 pmid: 1 publication: European Journal of Cell Biology publication_status: published publisher: Elsevier publist_id: '3534' quality_controlled: '1' scopus_import: 1 status: public title: Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 91 year: '2012' ... --- _id: '3248' abstract: - lang: eng 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. article_processing_charge: No article_type: original author: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Jan full_name: Peters, Jan last_name: Peters citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T12:02:15Z date_published: 2012-03-01T00:00:00Z date_updated: 2022-05-24T08:05:40Z day: '01' ddc: - '000' department: - _id: ChLa doi: 10.1007/s11554-010-0168-3 file: - access_level: open_access checksum: 241be47ea50e81a283bcf4c45b07e8cc content_type: application/pdf creator: kschuh date_created: 2019-02-12T10:52:25Z date_updated: 2020-07-14T12:46:04Z file_id: '5958' file_name: 2012_Springer_Lampert.pdf file_size: 2933187 relation: main_file file_date_updated: 2020-07-14T12:46:04Z has_accepted_license: '1' intvolume: ' 7' issue: '1' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 31 - 41 publication: Journal of Real-Time Image Processing publication_identifier: eissn: - 1861-8219 issn: - 1861-8200 publication_status: published publisher: Springer publist_id: '3417' quality_controlled: '1' scopus_import: '1' status: public title: Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2012' ... --- _id: '3247' abstract: - lang: eng 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. 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." author: - first_name: Sibelle full_name: Vilaça, Sibelle last_name: Vilaça - first_name: Rodrigo A full_name: Fernandes Redondo, Rodrigo A id: 409D5C96-F248-11E8-B48F-1D18A9856A87 last_name: Fernandes Redondo orcid: 0000-0002-5837-2793 - first_name: Lívia full_name: Lins, Lívia last_name: Lins - first_name: Fabrício full_name: Santos, Fabrício last_name: Santos citation: 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 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. 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. 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. short: S. Vilaça, R.A. Fernandes Redondo, L. Lins, F. Santos, Conservation Genetics 13 (2012) 293–298. date_created: 2018-12-11T12:02:15Z date_published: 2012-02-01T00:00:00Z date_updated: 2021-01-12T07:42:05Z day: '01' department: - _id: JoBo doi: 10.1007/s10592-011-0262-5 intvolume: ' 13' issue: '1' language: - iso: eng month: '02' oa_version: None page: 293 - 298 publication: Conservation Genetics publication_status: published publisher: Springer publist_id: '3420' quality_controlled: '1' scopus_import: 1 status: public title: Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2012' ... --- _id: '3245' abstract: - lang: eng 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. author: - first_name: Martin full_name: Behrndt, Martin id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87 last_name: Behrndt - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: 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. 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. ista: Behrndt M, Heisenberg C-PJ. 2012. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 22(1), 3–4. 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. short: M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 22 (2012) 3–4. date_created: 2018-12-11T12:02:14Z date_published: 2012-01-17T00:00:00Z date_updated: 2021-01-12T07:42:05Z day: '17' department: - _id: CaHe doi: 10.1016/j.devcel.2011.12.018 intvolume: ' 22' issue: '1' language: - iso: eng month: '01' oa_version: None page: 3 - 4 publication: Developmental Cell publication_status: published publisher: Cell Press publist_id: '3426' quality_controlled: '1' scopus_import: 1 status: public title: Spurred by resistance mechanosensation in collective migration type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2012' ... --- _id: '3262' 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. 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." article_number: '041903' author: - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Aleksandra full_name: Walczak, Aleksandra last_name: Walczak - first_name: William full_name: Bialek, William last_name: Bialek citation: 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 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. 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. 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. 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. short: G. Tkačik, A. Walczak, W. Bialek, Physical Review E Statistical Nonlinear and Soft Matter Physics 85 (2012). date_created: 2018-12-11T12:02:20Z date_published: 2012-04-01T00:00:00Z date_updated: 2021-01-12T07:42:14Z day: '01' department: - _id: GaTk doi: 10.1103/PhysRevE.85.041903 intvolume: ' 85' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1112.5026 month: '04' oa: 1 oa_version: Preprint publication: ' Physical Review E statistical nonlinear and soft matter physics ' publication_status: published publisher: American Institute of Physics publist_id: '3386' quality_controlled: '1' scopus_import: 1 status: public title: Optimizing information flow in small genetic networks. III. A self-interacting gene type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 85 year: '2012' ... --- _id: '3257' abstract: - lang: eng 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. author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov 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 chicago: Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics. Elsevier, 2012. 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. ista: Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 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. short: V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426. date_created: 2018-12-11T12:02:18Z date_published: 2012-03-01T00:00:00Z date_updated: 2023-02-23T11:04:49Z day: '01' department: - _id: VlKo doi: 10.1016/j.dam.2011.10.026 external_id: arxiv: - '1005.2305' intvolume: ' 160' issue: 4-5 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1005.2305 month: '03' oa: 1 oa_version: Preprint page: 416 - 426 publication: Discrete Applied Mathematics publication_status: published publisher: Elsevier publist_id: '3397' quality_controlled: '1' related_material: record: - id: '2934' relation: earlier_version status: public scopus_import: 1 status: public title: Generalized roof duality and bisubmodular functions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 160 year: '2012' ... --- _id: '3277' 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. alternative_title: - Cellular Origin, Life in Extreme Habitats and Astrobiology author: - first_name: Harold full_name: de Vladar, Harold id: 2A181218-F248-11E8-B48F-1D18A9856A87 last_name: de Vladar orcid: 0000-0002-5985-7653 - first_name: Julian full_name: Chela Flores, Julian last_name: Chela Flores citation: 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 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. 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. 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.' 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. short: H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405. date_created: 2018-12-11T12:02:25Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:42:20Z day: '01' department: - _id: NiBa doi: 10.1007/978-94-007-4966-5_22 intvolume: ' 24' language: - iso: eng month: '01' oa_version: None page: 387 - 405 publication: Life on Earth and other planetary bodies publication_status: published publisher: Springer publist_id: '3369' quality_controlled: '1' status: public title: Can the evolution of multicellularity be anticipated in the exploration of the solar system? type: book_chapter user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2012' ... --- _id: '3279' abstract: - lang: eng 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" acknowledgement: Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC) alternative_title: - LNCS author: - first_name: Abhishek full_name: Jain, Abhishek last_name: Jain - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Aris full_name: Tentes, Aris last_name: Tentes citation: 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' 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' 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. 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.' ista: 'Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382.' 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. conference: end_date: 2012-03-21 location: Taormina, Sicily, Italy name: 'TCC: Theory of Cryptography Conference' start_date: 2012-03-19 date_created: 2018-12-11T12:02:25Z date_published: 2012-05-04T00:00:00Z date_updated: 2021-01-12T07:42:21Z day: '04' department: - _id: KrPi doi: 10.1007/978-3-642-28914-9_21 ec_funded: 1 intvolume: ' 7194' language: - iso: eng main_file_link: - url: http://www.iacr.org/archive/tcc2012/tcc2012-index.html month: '05' oa_version: None page: 369 - 382 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication_status: published publisher: Springer publist_id: '3367' quality_controlled: '1' scopus_import: 1 status: public title: Hardness preserving constructions of pseudorandom functions type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7194 year: '2012' ... --- _id: '3274' abstract: - lang: eng 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. 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. author: - first_name: Georg full_name: Rieckh, Georg id: 34DA8BD6-F248-11E8-B48F-1D18A9856A87 last_name: Rieckh - first_name: Wolfgang full_name: Kreuzer, Wolfgang last_name: Kreuzer - first_name: Holger full_name: Waubke, Holger last_name: Waubke - first_name: Peter full_name: Balazs, Peter last_name: Balazs 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 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. 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. 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. 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. short: G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967. date_created: 2018-12-11T12:02:24Z date_published: 2012-06-01T00:00:00Z date_updated: 2021-01-12T07:42:19Z day: '01' department: - _id: GaTk doi: 10.1016/j.enganabound.2011.12.014 intvolume: ' 36' issue: '6' language: - iso: eng month: '06' oa_version: None page: 960 - 967 publication: ' Engineering Analysis with Boundary Elements' publication_status: published publisher: Elsevier publist_id: '3372' quality_controlled: '1' scopus_import: 1 status: public title: A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2012' ... --- _id: '3289' abstract: - lang: eng 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" 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." author: - first_name: Anna full_name: Pereira, Anna last_name: Pereira - first_name: Flávia full_name: Leite, Flávia id: 36705F98-F248-11E8-B48F-1D18A9856A87 last_name: Leite - first_name: Bruno full_name: Brasil, Bruno last_name: Brasil - first_name: Jamaria full_name: Soares Martins, Jamaria last_name: Soares Martins - first_name: Alice full_name: Torres, Alice last_name: Torres - first_name: Paulo full_name: Pimenta, Paulo last_name: Pimenta - first_name: Thais full_name: Souto Padrón, Thais last_name: Souto Padrón - first_name: Paula full_name: Tranktman, Paula last_name: Tranktman - first_name: Paulo full_name: Ferreira, Paulo last_name: Ferreira - first_name: Erna full_name: Kroon, Erna last_name: Kroon - first_name: Cláudio full_name: Bonjardim, Cláudio last_name: Bonjardim citation: 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 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. 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. 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. 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. 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. date_created: 2018-12-11T12:02:29Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:42:25Z day: '01' department: - _id: JoBo doi: 10.1128/JVI.05638-11 external_id: pmid: - '22031940' intvolume: ' 86' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/ month: '01' oa: 1 oa_version: Submitted Version page: 172 - 184 pmid: 1 publication: Journal of Virology publication_status: published publisher: ASM publist_id: '3356' quality_controlled: '1' scopus_import: 1 status: public title: A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 86 year: '2012' ... --- _id: '3310' abstract: - lang: eng 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. acknowledgement: Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624. author: - first_name: Paul full_name: Bendich, Paul id: 43F6EC54-F248-11E8-B48F-1D18A9856A87 last_name: Bendich - first_name: Sergio full_name: Cabello, Sergio last_name: Cabello - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: 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. 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. ista: Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444. 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. date_created: 2018-12-11T12:02:36Z date_published: 2012-08-01T00:00:00Z date_updated: 2021-01-12T07:42:34Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1016/j.patrec.2011.10.007 file: - access_level: open_access checksum: d65f79775b51258a604ca5ec741297cc content_type: application/pdf creator: system date_created: 2018-12-12T10:15:00Z date_updated: 2020-07-14T12:46:06Z file_id: '5116' file_name: IST-2016-542-v1+1_2012-J-01-Poinculus.pdf file_size: 280280 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' intvolume: ' 33' issue: '11' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 1436 - 1444 publication: Pattern Recognition Letters publication_status: published publisher: Elsevier publist_id: '3330' pubrep_id: '542' quality_controlled: '1' scopus_import: 1 status: public title: A point calculus for interlevel set homology type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2012' ... --- _id: '338' abstract: - lang: eng 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. 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" article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Reza full_name: Zamani, Reza last_name: Zamani - first_name: Wenhua full_name: Li, Wenhua last_name: Li - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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 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 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. 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. 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. short: M. Ibáñez, R. Zamani, W. Li, A. Shavel, J. Arbiol, J. Morante, A. Cabot, Crystal Growth and Design 12 (2012) 1085–1090. date_created: 2018-12-11T11:45:54Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:43:05Z day: '01' doi: 10.1021/cg201709c extern: '1' intvolume: ' 12' issue: '3' language: - iso: eng month: '01' oa_version: None page: 1085 - 1090 publication: 'Crystal Growth and Design ' publication_status: published publisher: American Chemical Society (ACS) publist_id: '7488' quality_controlled: '1' status: public title: Extending the nanocrystal synthesis control to quaternary compositions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2012' ... --- _id: '339' 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. article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - 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 - first_name: Wenhua full_name: Li, Wenhua last_name: Li - first_name: Andrew full_name: Fairbrother, Andrew last_name: Fairbrother - first_name: Joan full_name: Prades, Joan last_name: Prades - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Alejandro full_name: Pérez Rodríguez, Alejandro last_name: Pérez Rodríguez - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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.' 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.' 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.' 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. date_created: 2018-12-11T11:45:54Z date_published: 2012-01-31T00:00:00Z date_updated: 2021-01-12T07:43:09Z day: '31' doi: 10.1021/cm2031812 extern: '1' intvolume: ' 24' issue: '3' language: - iso: eng month: '01' oa_version: None page: 562 - 570 publication: Chemistry of Materials publication_status: published publisher: American Chemical Society publist_id: '7489' quality_controlled: '1' status: public title: 'Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2012' ... --- _id: '340' 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. ' 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. article_processing_charge: No article_type: original author: - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Alex full_name: Carrete, Alex last_name: Carrete - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot 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 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. 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. 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. 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. short: A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441. date_created: 2018-12-11T11:45:54Z date_published: 2012-01-02T00:00:00Z date_updated: 2021-01-12T07:43:13Z day: '02' doi: 10.1021/ja209688a extern: '1' intvolume: ' 134' issue: '3' language: - iso: eng month: '01' oa_version: None page: 1438 - 1441 publication: Journal of the American Chemical Society publication_status: published publisher: ACS publist_id: '7490' quality_controlled: '1' status: public title: Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 134 year: '2012' ... --- _id: '345' abstract: - lang: eng 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. ' 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. article_processing_charge: No article_type: original author: - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Stéphane full_name: Gorsse, Stéphane last_name: Gorsse - first_name: Antonio full_name: López, Antonio last_name: López - first_name: Albert full_name: Cirera, Albert last_name: Cirera - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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' 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' 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.' 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.' 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).' 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.' short: D. Cadavid, M. Ibáñez, S. Gorsse, A. López, A. Cirera, J. Morante, A. Cabot, Journal of Nanoparticle Research 14 (2012). date_created: 2018-12-11T11:45:56Z date_published: 2012-12-01T00:00:00Z date_updated: 2021-01-12T07:43:32Z day: '01' doi: 10.1007/s11051-012-1328-0 extern: '1' intvolume: ' 14' issue: '12' language: - iso: eng month: '12' oa_version: None publication: Journal of Nanoparticle Research publication_status: published publisher: Kluwer publist_id: '7485' quality_controlled: '1' status: public title: 'Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2012' ... --- _id: '347' 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. ' 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. article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Reza full_name: Zamani, Reza last_name: Zamani - first_name: Aaron full_name: Lalonde, Aaron last_name: Lalonde - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Wenhua full_name: Li, Wenhua last_name: Li - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Stéphane full_name: Gorsse, Stéphane last_name: Gorsse - first_name: G Jeffrey full_name: Snyder, G Jeffrey last_name: Snyder - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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' 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' 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.' 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.' 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.' 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.' 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. date_created: 2018-12-11T11:45:57Z date_published: 2012-03-07T00:00:00Z date_updated: 2021-01-12T07:43:40Z day: '07' doi: 10.1021/ja211952z extern: '1' intvolume: ' 134' issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://authors.library.caltech.edu/30261/ month: '03' oa: 1 oa_version: None page: 4060 - 4063 publication: Journal of the American Chemical Society publication_status: published publisher: ACS publist_id: '7487' quality_controlled: '1' status: public title: 'Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 134 year: '2012' ... --- _id: '3836' 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. author: - first_name: Arkadeb full_name: Ghosal, Arkadeb last_name: Ghosal - first_name: Daniel full_name: Iercan, Daniel last_name: Iercan - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Alberto full_name: Sangiovanni Vincentelli, Alberto last_name: Sangiovanni Vincentelli citation: 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 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 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. 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. 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. 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. short: A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112. date_created: 2018-12-11T12:05:26Z date_published: 2012-02-01T00:00:00Z date_updated: 2021-01-12T07:52:32Z day: '01' department: - _id: ToHe doi: 10.1016/j.scico.2010.06.004 intvolume: ' 77' issue: '2' language: - iso: eng month: '02' oa_version: None page: 96 - 112 publication: Science of Computer Programming publication_status: published publisher: Elsevier publist_id: '2370' quality_controlled: '1' scopus_import: 1 status: public title: Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 77 year: '2012' ... --- _id: '2972' abstract: - lang: eng 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.' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen citation: ama: Chatterjee K, Doyen L. Energy parity games. Theoretical Computer Science. 2012;458:49-60. doi:10.1016/j.tcs.2012.07.038 apa: Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2012.07.038 chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/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. ista: Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 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. short: K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60. date_created: 2018-12-11T12:00:37Z date_published: 2012-11-02T00:00:00Z date_updated: 2023-02-23T11:45:29Z day: '02' ddc: - '004' department: - _id: KrCh doi: 10.1016/j.tcs.2012.07.038 ec_funded: 1 external_id: arxiv: - '1001.5183' file: - access_level: open_access checksum: 719e4a5af5a01ad3f2f7f7f05b3c2b09 content_type: application/pdf creator: kschuh date_created: 2019-02-06T11:56:22Z date_updated: 2020-07-14T12:45:57Z file_id: '5935' file_name: 2012_Elsevier_Chatterjee.pdf file_size: 351271 relation: main_file file_date_updated: 2020-07-14T12:45:57Z has_accepted_license: '1' intvolume: ' 458' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 49 - 60 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Theoretical Computer Science publication_status: published publisher: Elsevier publist_id: '3736' pubrep_id: '935' quality_controlled: '1' related_material: record: - id: '3851' relation: earlier_version status: public scopus_import: 1 status: public title: Energy parity games tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 458 year: '2012' ... --- _id: '2967' abstract: - lang: eng 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. 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. article_number: '27' author: - first_name: Rajeev full_name: Alur, Rajeev last_name: Alur - first_name: Pavol full_name: Cerny, Pavol id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87 last_name: Cerny - first_name: Scott full_name: Weinstein, Scott last_name: Weinstein citation: 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 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. 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. ista: Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27. 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. short: R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012). date_created: 2018-12-11T12:00:36Z date_published: 2012-08-01T00:00:00Z date_updated: 2023-02-23T12:09:43Z day: '01' department: - _id: ToHe doi: 10.1145/2287718.2287727 ec_funded: 1 intvolume: ' 13' issue: '3' language: - iso: eng month: '08' oa_version: None project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: ACM Transactions on Computational Logic (TOCL) publication_status: published publisher: ACM publist_id: '3748' quality_controlled: '1' related_material: record: - id: '4403' relation: earlier_version status: public scopus_import: 1 status: public title: Algorithmic analysis of array-accessing programs type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2012' ... --- _id: '492' 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.' article_number: '116' article_processing_charge: No author: - first_name: Taras full_name: Galkovskyi, Taras last_name: Galkovskyi - first_name: Yuriy full_name: Mileyko, Yuriy last_name: Mileyko - first_name: Alexander full_name: Bucksch, Alexander last_name: Bucksch - first_name: Brad full_name: Moore, Brad last_name: Moore - first_name: Olga full_name: Symonova, Olga id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87 last_name: Symonova - 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 - first_name: Paul full_name: Zurek, Paul last_name: Zurek - first_name: Suqin full_name: Fang, Suqin last_name: Fang - first_name: John full_name: Harer, John last_name: Harer - first_name: Philip full_name: Benfey, Philip last_name: Benfey - first_name: Joshua full_name: Weitz, Joshua last_name: Weitz citation: 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' 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.' 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.' 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.' 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.' 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). date_created: 2018-12-11T11:46:46Z date_published: 2012-07-26T00:00:00Z date_updated: 2022-08-25T14:59:17Z day: '26' ddc: - '005' - '514' - '516' doi: 10.1186/1471-2229-12-116 extern: '1' file: - access_level: open_access checksum: 0c629e36acd5f2878ff7dd088d67d494 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:35Z date_updated: 2020-07-14T12:46:35Z file_id: '4953' file_name: IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf file_size: 1691436 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 12' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: BMC Plant Biology publication_status: published publisher: BioMed Central publist_id: '7328' pubrep_id: '946' quality_controlled: '1' scopus_import: '1' status: public title: 'GiA Roots: Software for the high throughput analysis of plant root system architecture' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2012' ... --- _id: '493' 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.' 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" article_number: '55' author: - first_name: Michael full_name: Tangermann, Michael last_name: Tangermann - first_name: Klaus full_name: Müller, Klaus last_name: Müller - first_name: Ad full_name: Aertsen, Ad last_name: Aertsen - first_name: Niels full_name: Birbaumer, Niels last_name: Birbaumer - first_name: Christoph full_name: Braun, Christoph last_name: Braun - first_name: Clemens full_name: Brunner, Clemens last_name: Brunner - first_name: Robert full_name: Leeb, Robert last_name: Leeb - first_name: Carsten full_name: Mehring, Carsten last_name: Mehring - first_name: Kai full_name: Miller, Kai last_name: Miller - first_name: Gernot full_name: Müller Putz, Gernot last_name: Müller Putz - first_name: Guido full_name: Nolte, Guido last_name: Nolte - first_name: Gert full_name: Pfurtscheller, Gert last_name: Pfurtscheller - first_name: Hubert full_name: Preissl, Hubert last_name: Preissl - first_name: Gerwin full_name: Schalk, Gerwin last_name: Schalk - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Carmen full_name: Vidaurre, Carmen last_name: Vidaurre - first_name: Stephan full_name: Waldert, Stephan last_name: Waldert - first_name: Benjamin full_name: Blankertz, Benjamin last_name: Blankertz citation: 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 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 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. ieee: M. Tangermann et al., “Review of the BCI competition IV,” Frontiers in Neuroscience, vol. 6. Frontiers Research Foundation, 2012. 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. 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. 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). date_created: 2018-12-11T11:46:46Z date_published: 2012-07-13T00:00:00Z date_updated: 2021-01-12T08:01:03Z day: '13' ddc: - '004' department: - _id: ScienComp - _id: PeJo doi: 10.3389/fnins.2012.00055 file: - access_level: open_access checksum: 195238221c4b0b0f4035f6f6c16ea17c content_type: application/pdf creator: system date_created: 2018-12-12T10:18:34Z date_updated: 2020-07-14T12:46:35Z file_id: '5356' file_name: IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf file_size: 2693701 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Frontiers in Neuroscience publication_status: published publisher: Frontiers Research Foundation publist_id: '7327' pubrep_id: '945' quality_controlled: '1' scopus_import: 1 status: public title: Review of the BCI competition IV tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2012' ... --- _id: '495' 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. alternative_title: - EPTCS author: - first_name: Alex full_name: Kruckman, Alex last_name: Kruckman - first_name: Sasha full_name: Rubin, Sasha id: 2EC51194-F248-11E8-B48F-1D18A9856A87 last_name: Rubin - first_name: John full_name: Sheridan, John last_name: Sheridan - first_name: Ben full_name: Zax, Ben last_name: Zax citation: 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' 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' 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. 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. 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.' 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. short: A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246. conference: end_date: 2012-09-08 location: Napoli, Italy name: 'GandALF: Games, Automata, Logics and Formal Verification' start_date: 2012-09-06 date_created: 2018-12-11T11:46:47Z date_published: 2012-10-07T00:00:00Z date_updated: 2021-01-12T08:01:04Z day: '07' ddc: - '004' department: - _id: KrCh doi: 10.4204/EPTCS.96.18 ec_funded: 1 file: - access_level: open_access checksum: 56277f95edc9d531fa3bdc5f9579fda8 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:31Z date_updated: 2020-07-14T12:46:35Z file_id: '5152' file_name: IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf file_size: 97736 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 96' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 238 - 246 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' publication: Proceedings GandALF 2012 publication_status: published publisher: Open Publishing Association publist_id: '7325' pubrep_id: '944' quality_controlled: '1' scopus_import: 1 status: public title: A Myhill Nerode theorem for automata with advice tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 96 year: '2012' ... --- _id: '498' 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. 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" author: - first_name: Melinda full_name: Pickup, Melinda id: 2C78037E-F248-11E8-B48F-1D18A9856A87 last_name: Pickup orcid: 0000-0001-6118-0541 - first_name: David full_name: Field, David id: 419049E2-F248-11E8-B48F-1D18A9856A87 last_name: Field orcid: 0000-0002-4014-8478 - first_name: David full_name: Rowell, David last_name: Rowell - first_name: Andrew full_name: Young, Andrew last_name: Young citation: 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' 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.' 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.' 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.' 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.' short: M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924. date_created: 2018-12-11T11:46:48Z date_published: 2012-12-01T00:00:00Z date_updated: 2021-01-12T08:01:06Z day: '01' ddc: - '576' department: - _id: NiBa doi: 10.1111/j.1752-4571.2012.00284.x file: - access_level: open_access checksum: 233007138606aca5a2f75f7ae1742f43 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:33Z date_updated: 2020-07-14T12:46:35Z file_id: '4821' file_name: IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf file_size: 396136 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 5' issue: '8' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '12' oa: 1 oa_version: Published Version page: 913 - 924 publication: Evolutionary Applications publication_status: published publisher: Wiley-Blackwell publist_id: '7322' pubrep_id: '942' quality_controlled: '1' status: public title: 'Predicting local adaptation in fragmented plant populations: Implications for restoration genetics' tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2012' ... --- _id: '496' 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.' alternative_title: - LICS article_number: '6280474' author: - first_name: Alexander full_name: Rabinovich, Alexander last_name: Rabinovich - first_name: Sasha full_name: Rubin, Sasha id: 2EC51194-F248-11E8-B48F-1D18A9856A87 last_name: Rubin citation: 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' chicago: Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65. 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.' 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. short: A. Rabinovich, S. Rubin, in:, IEEE, 2012. conference: end_date: 2012-06-28 location: Dubrovnik, Croatia name: 'LICS: Symposium on Logic in Computer Science' start_date: 2012-06-25 date_created: 2018-12-11T11:46:47Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T08:01:05Z day: '01' department: - _id: KrCh doi: 10.1109/LICS.2012.65 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf month: '01' oa: 1 oa_version: Preprint project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: IEEE publist_id: '7324' quality_controlled: '1' scopus_import: 1 status: public title: Interpretations in trees with countably many branches type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '494' 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. article_number: '29' author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: 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 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. 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. 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. 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. short: U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012). date_created: 2018-12-11T11:46:47Z date_published: 2012-10-01T00:00:00Z date_updated: 2021-01-12T08:01:03Z day: '01' department: - _id: ToHe doi: 10.1145/2362355.2362357 intvolume: ' 13' issue: '4' language: - iso: eng month: '10' oa_version: None publication: ACM Transactions on Computational Logic (TOCL) publication_status: published publisher: ACM publist_id: '7326' quality_controlled: '1' scopus_import: 1 status: public title: Translating to Co-Büchi made tight, unified, and useful type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2012' ... --- _id: '506' article_processing_charge: No article_type: original author: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: 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' 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' 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.' 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.' ista: 'Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.' 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.' short: M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349. date_created: 2018-12-11T11:46:51Z date_published: 2012-04-30T00:00:00Z date_updated: 2021-01-12T08:01:11Z day: '30' ddc: - '570' department: - _id: MiSi doi: 10.1083/jcb.201204039 file: - access_level: open_access checksum: 45c02be33ebd99fc3077d60b9c90bdfa content_type: application/pdf creator: kschuh date_created: 2019-02-12T09:03:09Z date_updated: 2020-07-14T12:46:36Z file_id: '5957' file_name: 2012_CellBiology_Sixt.pdf file_size: 986566 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 197' issue: '3' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 347 - 349 publication: Journal of Cell Biology publication_status: published publisher: Rockefeller University Press publist_id: '7314' quality_controlled: '1' scopus_import: 1 status: public title: 'Cell migration: Fibroblasts find a new way to get ahead' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 197 year: '2012' ... --- _id: '497' 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(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.' alternative_title: - LIPIcs author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Siddhesh full_name: Chaubal, Siddhesh last_name: Chaubal - first_name: Pritish full_name: Kamath, Pritish last_name: Kamath citation: 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' 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. 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.' 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.' 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. short: K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182. conference: end_date: 2012-09-06 location: Fontainebleau, France name: 'EACSL: European Association for Computer Science Logic' start_date: 2012-09-03 date_created: 2018-12-11T11:46:48Z date_published: 2012-09-01T00:00:00Z date_updated: 2023-02-23T12:23:32Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPIcs.CSL.2012.167 ec_funded: 1 file: - access_level: open_access checksum: f1b0dd99240800db2d7dbf9b5131fe5e content_type: application/pdf creator: system date_created: 2018-12-12T10:08:50Z date_updated: 2020-07-14T12:46:35Z file_id: '4712' file_name: IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf file_size: 471236 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 16' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 167 - 182 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7323' pubrep_id: '943' quality_controlled: '1' related_material: record: - id: '5378' relation: earlier_version status: public scopus_import: 1 status: public title: Faster algorithms for alternating refinement relations tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2012' ... --- _id: '3165' abstract: - lang: eng 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. 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.' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: 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' 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' 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. 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. 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.' 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. short: K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399. conference: end_date: 2012-01-19 location: Kyoto, Japan name: 'SODA: Symposium on Discrete Algorithms' start_date: 2012-01-17 date_created: 2018-12-11T12:01:46Z date_published: 2012-01-01T00:00:00Z date_updated: 2023-02-23T12:23:35Z day: '01' department: - _id: KrCh doi: 10.1137/1.9781611973099.109 ec_funded: 1 external_id: arxiv: - '1109.5018' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1109.5018 month: '01' oa: 1 oa_version: None page: 1386 - 1399 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms publication_status: published publisher: SIAM publist_id: '3519' pubrep_id: '15' quality_controlled: '1' related_material: record: - id: '2141' relation: later_version status: public - id: '5379' relation: earlier_version status: public status: public title: An O(n2) time algorithm for alternating Büchi games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '2956' 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 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.' 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." article_number: '6280438' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: 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' 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' 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. 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. 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. short: K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012. conference: end_date: 2012-06-28 location: 'Dubrovnik, Croatia ' name: 'LICS: Logic in Computer Science' start_date: 2012-06-25 date_created: 2018-12-11T12:00:32Z date_published: 2012-08-23T00:00:00Z date_updated: 2023-02-23T12:23:30Z day: '23' department: - _id: KrCh doi: 10.1109/LICS.2012.30 ec_funded: 1 language: - iso: eng month: '08' oa_version: None project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science publication_status: published publisher: IEEE publist_id: '3770' quality_controlled: '1' related_material: record: - id: '5377' relation: earlier_version status: public scopus_import: 1 status: public title: Mean payoff pushdown games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '5377' 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.' alternative_title: - IST Austria Technical Report author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: ama: Chatterjee K, Velner Y. Mean-Payoff Pushdown Games. IST Austria; 2012. doi:10.15479/AT:IST-2012-0002 apa: Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002 chicago: Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002. ieee: K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012. ista: Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p. mla: Chatterjee, Krishnendu, and Yaron Velner. 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. date_created: 2018-12-12T11:38:59Z date_published: 2012-07-02T00:00:00Z date_updated: 2023-02-23T11:05:50Z day: '02' ddc: - '000' - '005' department: - _id: KrCh doi: 10.15479/AT:IST-2012-0002 file: - access_level: open_access checksum: a03c08c1589dbb0c96183a8bcf3ab240 content_type: application/pdf creator: system date_created: 2018-12-12T11:54:00Z date_updated: 2020-07-14T12:46:38Z file_id: '5522' file_name: IST-2012-002_IST-2012-0002.pdf file_size: 592098 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '33' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '10' related_material: record: - id: '2956' relation: later_version status: public status: public title: Mean-payoff pushdown games type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '5378' 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.' alternative_title: - IST Austria Technical Report author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Siddhesh full_name: Chaubal, Siddhesh last_name: Chaubal - first_name: Pritish full_name: Kamath, Pritish last_name: Kamath citation: 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 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. ieee: K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012. 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. short: K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012. date_created: 2018-12-12T11:38:59Z date_published: 2012-07-04T00:00:00Z date_updated: 2023-02-23T12:21:38Z day: '04' ddc: - '000' - '005' department: - _id: KrCh doi: 10.15479/AT:IST-2012-0001 file: - access_level: open_access checksum: ec8d1857cc7095d3de5107a0162ced37 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:28Z date_updated: 2020-07-14T12:46:39Z file_id: '5489' file_name: IST-2012-0001_IST-2012-0001.pdf file_size: 394256 relation: main_file file_date_updated: 2020-07-14T12:46:39Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '21' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '14' related_material: record: - id: '497' relation: later_version status: public status: public title: Faster algorithms for alternating refinement relations type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '2955' abstract: - lang: eng 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.' 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.' article_number: '6280436' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen citation: ama: 'Chatterjee K, Doyen L. 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' 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.' 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.' 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.' 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.' short: K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012. conference: end_date: 2012-06-28 location: Dubrovnik, Croatia name: 'LICS: Logic in Computer Science' start_date: 2012-06-25 date_created: 2018-12-11T12:00:32Z date_published: 2012-08-23T00:00:00Z date_updated: 2023-02-23T12:23:43Z day: '23' department: - _id: KrCh doi: 10.1109/LICS.2012.28 ec_funded: 1 external_id: arxiv: - '1107.2141' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.2141 month: '08' oa: 1 oa_version: Preprint project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science publication_status: published publisher: IEEE publist_id: '3771' quality_controlled: '1' related_material: record: - id: '2211' relation: later_version status: public - id: '5381' relation: earlier_version status: public scopus_import: 1 status: public title: 'Partial-observation stochastic games: How to win when belief fails' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '3341' abstract: - lang: eng 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).' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: 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' 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. 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.' ista: 'Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.' 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. short: K. Chatterjee, in:, Springer, 2012, pp. 270–285. conference: end_date: 2012-04-01 location: Tallinn, Estonia name: 'FoSSaCS: Foundations of Software Science and Computation Structures' start_date: 2012-03-24 date_created: 2018-12-11T12:02:46Z date_published: 2012-03-22T00:00:00Z date_updated: 2023-02-23T12:23:46Z day: '22' department: - _id: KrCh doi: 10.1007/978-3-642-28729-9_18 ec_funded: 1 external_id: arxiv: - '1107.2009' intvolume: ' 7213' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.2009 month: '03' oa: 1 oa_version: Preprint page: 270 - 285 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: Springer publist_id: '3284' quality_controlled: '1' related_material: record: - id: '5382' relation: earlier_version status: public scopus_import: 1 status: public title: Robustness of structurally equivalent concurrent parity games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7213 year: '2012' ... --- _id: '2957' abstract: - lang: eng 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.' article_number: '6280437' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Mathieu full_name: Tracol, Mathieu id: 3F54FA38-F248-11E8-B48F-1D18A9856A87 last_name: Tracol citation: 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' 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. 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. 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.' 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. short: K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012. conference: end_date: 2012-06-28 location: 'Dubrovnik, Croatia ' name: 'LICS: Logic in Computer Science' start_date: 2012-06-25 date_created: 2018-12-11T12:00:33Z date_published: 2012-08-23T00:00:00Z date_updated: 2023-02-23T12:23:51Z day: '23' department: - _id: KrCh doi: 10.1109/LICS.2012.29 ec_funded: 1 external_id: arxiv: - '1107.2091' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1107.2091 month: '08' oa: 1 oa_version: Preprint project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science publication_status: published publisher: IEEE publist_id: '3769' quality_controlled: '1' related_material: record: - id: '5384' relation: earlier_version status: public scopus_import: 1 status: public title: Decidable problems for probabilistic automata on infinite words type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '3249' abstract: - lang: eng 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. 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. author: - first_name: Pavol full_name: Cerny, Pavol id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87 last_name: Cerny - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Arjun full_name: Radhakrishna, Arjun id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87 last_name: Radhakrishna citation: ama: Cerny P, Henzinger TA, Radhakrishna A. 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 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. ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012. ista: Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35. 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. short: P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35. date_created: 2018-12-11T12:02:15Z date_published: 2012-01-06T00:00:00Z date_updated: 2023-02-23T12:24:04Z day: '06' department: - _id: ToHe doi: 10.1016/j.tcs.2011.08.002 ec_funded: 1 intvolume: ' 413' issue: '1' language: - iso: eng month: '01' oa_version: None page: 21 - 35 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems publication: Theoretical Computer Science publication_status: published publisher: Elsevier publist_id: '3408' pubrep_id: '42' quality_controlled: '1' related_material: record: - id: '4393' relation: earlier_version status: public - id: '5389' relation: earlier_version status: public scopus_import: 1 status: public title: Simulation distances type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 413 year: '2012' ... --- _id: '3124' abstract: - lang: eng 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" alternative_title: - Inferning 2012 author: - first_name: Filip full_name: Korc, Filip id: 476A2FD6-F248-11E8-B48F-1D18A9856A87 last_name: Korc - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: 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.' chicago: Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. “Approximating Marginals Using Discrete Energy Minimization.” 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.' ista: 'Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, .' mla: Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012. short: F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012. conference: end_date: 2012-07-01 location: Edinburgh, Scotland name: 'ICML: International Conference on Machine Learning' start_date: 2012-06-26 date_created: 2018-12-11T12:01:31Z date_published: 2012-06-30T00:00:00Z date_updated: 2023-02-23T12:24:24Z day: '30' ddc: - '000' department: - _id: ChLa - _id: VlKo file: - access_level: open_access checksum: 3d0d4246548c736857302aadb2ff5d15 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:34Z date_updated: 2020-07-14T12:46:00Z file_id: '4889' file_name: IST-2016-565-v1+1_DM-inferning2012.pdf file_size: 305836 relation: main_file file_date_updated: 2020-07-14T12:46:00Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version publication_status: published publisher: ICML publist_id: '3575' pubrep_id: '565' quality_controlled: '1' related_material: record: - id: '5396' relation: later_version status: public status: public title: Approximating marginals using discrete energy minimization type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '5396' 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. alternative_title: - IST Austria Technical Report author: - first_name: Filip full_name: Korc, Filip id: 476A2FD6-F248-11E8-B48F-1D18A9856A87 last_name: Korc - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: Korc F, Kolmogorov V, Lampert C. Approximating Marginals Using Discrete Energy Minimization. IST Austria; 2012. doi:10.15479/AT:IST-2012-0003 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 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. ieee: F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012. ista: Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p. mla: Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003. short: F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012. date_created: 2018-12-12T11:39:06Z date_published: 2012-07-23T00:00:00Z date_updated: 2023-02-23T11:13:22Z day: '23' ddc: - '000' department: - _id: VlKo - _id: ChLa doi: 10.15479/AT:IST-2012-0003 file: - access_level: open_access checksum: 7e0ba85ad123b13223aaf6cdde2d288c content_type: application/pdf creator: system date_created: 2018-12-12T11:53:29Z date_updated: 2020-07-14T12:46:44Z file_id: '5490' file_name: IST-2012-0003_IST-2012-0003.pdf file_size: 618744 relation: main_file file_date_updated: 2020-07-14T12:46:44Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '13' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '36' related_material: record: - id: '3124' relation: earlier_version status: public status: public title: Approximating marginals using discrete energy minimization type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '5398' abstract: - lang: eng 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. author: - first_name: Jana full_name: Porsche, Jana id: 3252EDC2-F248-11E8-B48F-1D18A9856A87 last_name: Porsche citation: ama: Porsche J. Actual State of Research Data @ ISTAustria. IST Austria; 2012. apa: Porsche, J. (2012). Actual state of research data @ ISTAustria. IST Austria. chicago: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012. ieee: J. Porsche, Actual state of research data @ ISTAustria. IST Austria, 2012. ista: Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p. mla: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012. short: J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012. date_created: 2018-12-12T11:39:06Z date_published: 2012-11-12T00:00:00Z date_updated: 2020-07-14T23:04:49Z day: '12' ddc: - '020' department: - _id: E-Lib file: - access_level: open_access checksum: e0a7c041eea1ca4b70ab6f9ec5177f4e content_type: application/pdf creator: system date_created: 2018-12-12T11:53:11Z date_updated: 2020-07-14T12:46:44Z file_id: '5472' file_name: IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf file_size: 238544 relation: main_file file_date_updated: 2020-07-14T12:46:44Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version publication_status: published publisher: IST Austria pubrep_id: '103' status: public title: Actual state of research data @ ISTAustria type: report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '5839' abstract: - lang: eng 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). " author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Jaya full_name: Sil, Jaya last_name: Sil citation: 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 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 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. 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. ista: Biswas R, Sil J. 2012. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 4, 820–824. 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. short: R. Biswas, J. Sil, Procedia Technology 4 (2012) 820–824. date_created: 2019-01-17T11:54:21Z date_published: 2012-05-01T00:00:00Z date_updated: 2021-01-12T08:03:43Z day: '01' ddc: - '000' doi: 10.1016/j.protcy.2012.05.134 extern: '1' file: - access_level: open_access checksum: ba0185986b151d8c11201f48cd505ceb content_type: application/pdf creator: dernst date_created: 2019-01-21T07:28:06Z date_updated: 2020-07-14T12:47:12Z file_id: '5863' file_name: 2012_Procedia_Biswas.pdf file_size: 305426 relation: main_file file_date_updated: 2020-07-14T12:47:12Z has_accepted_license: '1' intvolume: ' 4' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 820-824 publication: Procedia Technology publication_identifier: issn: - 2212-0173 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2012' ...