--- _id: '3250' abstract: - lang: eng text: The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of "provably secure" cryptographic schemes like encryption or authentication protocols. Being provably secure means that the scheme comes with a proof showing that the existence of an efficient adversary against the scheme implies that the underlying hardness assumption is wrong. LPN based schemes are appealing for theoretical and practical reasons. On the theoretical side, LPN based schemes offer a very strong security guarantee. The LPN problem is equivalent to the problem of decoding random linear codes, a problem that has been extensively studied in the last half century. The fastest known algorithms run in exponential time and unlike most number-theoretic problems used in cryptography, the LPN problem does not succumb to known quantum algorithms. On the practical side, LPN based schemes are often extremely simple and efficient in terms of code-size as well as time and space requirements. This makes them prime candidates for light-weight devices like RFID tags, which are too weak to implement standard cryptographic primitives like the AES block-cipher. This talk will be a gentle introduction to provable security using simple LPN based schemes as examples. Starting from pseudorandom generators and symmetric key encryption, over secret-key authentication protocols, and, if time admits, touching on recent constructions of public-key identification, commitments and zero-knowledge proofs. alternative_title: - LNCS author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Cryptography from learning parity with noise. In: Vol 7147. Springer; 2012:99-114. doi:10.1007/978-3-642-27660-6_9' apa: 'Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-27660-6_9' chicago: Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,” 7147:99–114. Springer, 2012. https://doi.org/10.1007/978-3-642-27660-6_9. ieee: 'K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.' ista: 'Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147, 99–114.' mla: Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9. short: K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114. conference: end_date: 2012-01-27 location: Špindlerův Mlýn, Czech Republic name: 'SOFSEM: Current Trends in Theory and Practice of Computer Science' start_date: 2012-01-21 date_created: 2018-12-11T12:02:15Z date_published: 2012-02-19T00:00:00Z date_updated: 2021-01-12T07:42:07Z day: '19' department: - _id: KrPi doi: 10.1007/978-3-642-27660-6_9 intvolume: ' 7147' language: - iso: eng month: '02' oa_version: None page: 99 - 114 publication_status: published publisher: Springer publist_id: '3407' quality_controlled: '1' scopus_import: 1 status: public title: Cryptography from learning parity with noise type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7147 year: '2012' ... --- _id: '3256' abstract: - lang: eng text: We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n. acknowledgement: This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624. author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 2012;47(2):393-414. doi:10.1007/s00454-011-9382-4 apa: Edelsbrunner, H., & Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-011-9382-4 chicago: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-011-9382-4. ieee: H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” Discrete & Computational Geometry, vol. 47, no. 2. Springer, pp. 393–414, 2012. ista: Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414. mla: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4. short: H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012) 393–414. date_created: 2018-12-11T12:02:17Z date_published: 2012-03-01T00:00:00Z date_updated: 2021-01-12T07:42:10Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s00454-011-9382-4 file: - access_level: open_access checksum: 76486f3b2c9e7fd81342f3832ca387e7 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:15Z date_updated: 2020-07-14T12:46:05Z file_id: '4675' file_name: IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf file_size: 203636 relation: main_file file_date_updated: 2020-07-14T12:46:05Z has_accepted_license: '1' intvolume: ' 47' issue: '2' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 393 - 414 publication: Discrete & Computational Geometry publication_status: published publisher: Springer publist_id: '3398' pubrep_id: '543' quality_controlled: '1' scopus_import: 1 status: public title: Dual complexes of cubical subdivisions of ℝn type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2012' ... --- _id: '3254' abstract: - lang: eng text: 'The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes.' acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.' 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. The complexity of stochastic Müller games. Information and Computation. 2012;211:29-48. doi:10.1016/j.ic.2011.11.004 apa: Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004 chicago: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004. ieee: K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211. Elsevier, pp. 29–48, 2012. ista: Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48. mla: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004. short: K. Chatterjee, Information and Computation 211 (2012) 29–48. date_created: 2018-12-11T12:02:17Z date_published: 2012-02-01T00:00:00Z date_updated: 2021-01-12T07:42:09Z day: '01' department: - _id: KrCh doi: 10.1016/j.ic.2011.11.004 ec_funded: 1 intvolume: ' 211' language: - iso: eng main_file_link: - url: http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf month: '02' oa_version: None page: 29 - 48 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: Information and Computation publication_status: published publisher: Elsevier publist_id: '3403' quality_controlled: '1' scopus_import: 1 status: public title: The complexity of stochastic Müller games type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 211 year: '2012' ... --- _id: '3253' abstract: - lang: eng text: We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs. acknowledgement: This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016). alternative_title: - LNCS author: - first_name: Ahmed full_name: Bouajjani, Ahmed last_name: Bouajjani - first_name: Cezara full_name: Dragoi, Cezara id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87 last_name: Dragoi - first_name: Constantin full_name: Enea, Constantin last_name: Enea - first_name: Mihaela full_name: Sighireanu, Mihaela last_name: Sighireanu citation: ama: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:10.1007/978-3-642-27940-9_1' apa: 'Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1' chicago: Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1. ieee: 'A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.' ista: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.' mla: Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012, pp. 1–22, doi:10.1007/978-3-642-27940-9_1. short: A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22. conference: end_date: 2012-01-24 location: Philadelphia, PA, USA name: 'VMCAI: Verification, Model Checking and Abstract Interpretation' start_date: 2012-01-22 date_created: 2018-12-11T12:02:17Z date_published: 2012-02-26T00:00:00Z date_updated: 2021-01-12T07:42:09Z day: '26' department: - _id: ToHe doi: 10.1007/978-3-642-27940-9_1 intvolume: ' 7148' language: - iso: eng month: '02' oa_version: None page: 1 - 22 publication_status: published publisher: Springer publist_id: '3404' quality_controlled: '1' status: public title: Abstract domains for automated reasoning about list manipulating programs with infinite data type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7148 year: '2012' ... --- _id: '3265' abstract: - lang: eng text: We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and scales, into larger interpretations (tilings) of the entire image. Inference is cast as optimization over sets of maximal cliques sampled from a graph connecting all non-overlapping figure-ground segment hypotheses. Potential functions over cliques combine unary, Gestalt-based figure qualities, and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics of real scenes. Learning the model parameters is based on maximum likelihood, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where a 28% improvement was achieved. article_number: '6126486' author: - first_name: Adrian full_name: Ion, Adrian id: 29F89302-F248-11E8-B48F-1D18A9856A87 last_name: Ion - first_name: Joao full_name: Carreira, Joao last_name: Carreira - first_name: Cristian full_name: Sminchisescu, Cristian last_name: Sminchisescu citation: ama: 'Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:10.1109/ICCV.2011.6126486' apa: 'Ion, A., Carreira, J., & Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126486' chicago: Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. https://doi.org/10.1109/ICCV.2011.6126486. ieee: 'A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.' ista: 'Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.' mla: Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486. short: A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012. conference: end_date: 2011-11-13 location: Barcelona, Spain name: 'ICCV: International Conference on Computer Vision' start_date: 2011-11-06 date_created: 2018-12-11T12:02:21Z date_published: 2012-01-12T00:00:00Z date_updated: 2021-01-12T07:42:15Z day: '12' department: - _id: HeEd doi: 10.1109/ICCV.2011.6126486 language: - iso: eng month: '01' oa_version: None publication_status: published publisher: IEEE publist_id: '3382' quality_controlled: '1' status: public title: Image segmentation by figure-ground composition into maximal cliques type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '3282' abstract: - lang: eng text: 'Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is "message-hiding" into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt''11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research.' 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: Yevgeniy full_name: Dodis, Yevgeniy last_name: Dodis - 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: Eike full_name: Kiltz, Eike last_name: Kiltz - first_name: Daniel full_name: Wichs, Daniel last_name: Wichs citation: ama: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:10.1007/978-3-642-29011-4_22' apa: 'Dodis, Y., Pietrzak, K. Z., Kiltz, E., & Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. https://doi.org/10.1007/978-3-642-29011-4_22' chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. https://doi.org/10.1007/978-3-642-29011-4_22. ieee: 'Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.' ista: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237, 355–374.' mla: Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22. short: Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374. conference: end_date: 2012-04-19 location: Cambridge, UK name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques' start_date: 2012-04-15 date_created: 2018-12-11T12:02:27Z date_published: 2012-03-10T00:00:00Z date_updated: 2021-01-12T07:42:22Z day: '10' ddc: - '000' - '004' department: - _id: KrPi doi: 10.1007/978-3-642-29011-4_22 ec_funded: 1 file: - access_level: open_access checksum: 8557c17a8c2586d06ebfe62d934f5c5f content_type: application/pdf creator: system date_created: 2018-12-12T10:14:23Z date_updated: 2020-07-14T12:46:06Z file_id: '5074' file_name: IST-2016-686-v1+1_059.pdf file_size: 372292 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' intvolume: ' 7237' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '03' oa: 1 oa_version: Submitted Version page: 355 - 374 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: '3364' pubrep_id: '686' quality_controlled: '1' status: public title: Message authentication, revisited 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: 7237 year: '2012' ... --- _id: '3280' abstract: - lang: eng text: 'The (decisional) learning with errors problem (LWE) asks to distinguish "noisy" inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called "subspace LWE" (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. ' 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: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:10.1007/978-3-642-28914-9_31' apa: 'Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_31' chicago: Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_31. ieee: 'K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.' ista: 'Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563.' mla: Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31. short: K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563. 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:26Z 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_31 ec_funded: 1 intvolume: ' 7194' language: - iso: eng main_file_link: - open_access: '1' url: http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf month: '05' oa: 1 oa_version: Submitted Version page: 548 - 563 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: '3366' quality_controlled: '1' status: public title: Subspace LWE type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7194 year: '2012' ... --- _id: '3281' abstract: - lang: eng text: 'We consider the problem of amplifying the "lossiness" of functions. We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f has image size at most 2 m-L. The question is whether such C* exists for L/m ≫ ℓ/n. This problem arises naturally in the context of cryptographic "lossy functions," where the relative lossiness is the key parameter. We show that for every circuit C* that makes at most t queries to f, the relative lossiness of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making a polynomial t = poly(n) number of queries can amplify relative lossiness by more than an O(logn)/n additive term. We show that this is tight by giving a simple construction (cascading with some randomization) that achieves such amplification.' acknowledgement: "We would like to thank Oded Goldreich and Omer Rein- gold for discussions at an early stage of this project, and Scott Aaronson for clarifications regarding the collision problem.\r\n" alternative_title: - LNCS author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Alon full_name: Rosen, Alon last_name: Rosen - first_name: Gil full_name: Segev, Gil last_name: Segev citation: ama: 'Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:10.1007/978-3-642-28914-9_26' apa: 'Pietrzak, K. Z., Rosen, A., & Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_26' chicago: Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_26. ieee: 'K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.' ista: 'Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.' mla: Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26. short: K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475. 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:26Z date_published: 2012-05-04T00:00:00Z date_updated: 2021-01-12T07:42:22Z day: '04' department: - _id: KrPi doi: 10.1007/978-3-642-28914-9_26 intvolume: ' 7194' language: - iso: eng main_file_link: - url: http://www.iacr.org/archive/tcc2012/tcc2012-index.html month: '05' oa_version: None page: 458 - 475 publication_status: published publisher: Springer publist_id: '3365' quality_controlled: '1' status: public title: Lossy functions do not amplify well type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7194 year: '2012' ... --- _id: '3284' abstract: - lang: eng text: |- We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective. We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom). We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08]. Our results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages. acknowledgement: Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC. author: - first_name: Vladimir full_name: Vladimir Kolmogorov id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Stanislav full_name: Živný, Stanislav last_name: Živný citation: ama: 'Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759.' apa: 'Kolmogorov, V., & Živný, S. (2012). The complexity of conservative valued CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.' chicago: Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012. ieee: 'V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.' ista: 'Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759.' mla: Kolmogorov, Vladimir, and Stanislav Živný. The Complexity of Conservative Valued CSPs. SIAM, 2012, pp. 750–59. short: V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759. conference: name: 'SODA: Symposium on Discrete Algorithms' date_created: 2018-12-11T12:02:27Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:42:23Z day: '01' extern: 1 main_file_link: - open_access: '1' url: http://arxiv.org/abs/1008.1555 month: '01' oa: 1 page: 750 - 759 publication_status: published publisher: SIAM publist_id: '3362' quality_controlled: 0 status: public title: The complexity of conservative valued CSPs type: conference year: '2012' ... --- _id: '330' 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. ' 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:51Z date_published: 2012-01-02T00:00:00Z date_updated: 2021-01-12T07:42:29Z 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: '7531' 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: '3317' abstract: - lang: eng text: The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission. acknowledgement: "Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n" author: - first_name: Emmanuel full_name: Eggermann, Emmanuel id: 34DACA34-E9AE-11E9-849C-D35BD8ADC20C last_name: Eggermann - first_name: Iancu full_name: Bucurenciu, Iancu id: 4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A last_name: Bucurenciu - first_name: Sarit full_name: Goswami, Sarit id: 3A578F32-F248-11E8-B48F-1D18A9856A87 last_name: Goswami - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 2012;13(1):7-21. doi:10.1038/nrn3125 apa: Eggermann, E., Bucurenciu, I., Goswami, S., & Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nrn3125 chicago: Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nrn3125. ieee: E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” Nature Reviews Neuroscience, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012. ista: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21. mla: Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:10.1038/nrn3125. short: E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21. date_created: 2018-12-11T12:02:38Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:42:36Z day: '01' ddc: - '570' department: - _id: PeJo doi: 10.1038/nrn3125 file: - access_level: open_access checksum: 4c1c86b2f6e4e1562f5bb800b457ea9f content_type: application/pdf creator: system date_created: 2018-12-12T10:12:13Z date_updated: 2020-07-14T12:46:07Z file_id: '4931' file_name: IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf file_size: 314246 relation: main_file - access_level: open_access checksum: bceb2efdd49d115f4dde8486bc1be3f2 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:14Z date_updated: 2020-07-14T12:46:07Z file_id: '4932' file_name: IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf file_size: 1840216 relation: main_file file_date_updated: 2020-07-14T12:46:07Z has_accepted_license: '1' intvolume: ' 13' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 7 - 21 project: - _id: 25BC64A8-B435-11E9-9278-68D0E5697425 grant_number: JO_780/A5 name: Synaptic Mechanisms of Neuronal Network Function - _id: 25BDE9A4-B435-11E9-9278-68D0E5697425 grant_number: SFB-TR3-TP10B name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen publication: Nature Reviews Neuroscience publication_status: published publisher: Nature Publishing Group publist_id: '3322' pubrep_id: '820' quality_controlled: '1' scopus_import: 1 status: public title: Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2012' ... --- _id: '3314' abstract: - lang: eng text: We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 2012;23(3):609-625. doi:10.1142/S0129054112400308 apa: Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054112400308 chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308. ieee: K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012. ista: Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625. mla: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308. short: K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625. date_created: 2018-12-11T12:02:37Z date_published: 2012-04-01T00:00:00Z date_updated: 2021-01-12T07:42:35Z day: '01' department: - _id: KrCh doi: 10.1142/S0129054112400308 intvolume: ' 23' issue: '3' language: - iso: eng month: '04' oa_version: None page: 609 - 625 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: International Journal of Foundations of Computer Science publication_status: published publisher: World Scientific Publishing publist_id: '3326' quality_controlled: '1' scopus_import: 1 status: public title: Discounting and averaging in games across time scales type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2012' ... --- _id: '3115' abstract: - lang: eng text: 'We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P''s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one.' acknowledgement: "We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting the digital-pen offset-deconstruction problem. This work has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation (grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational Geometry Learning).\r\n" author: - first_name: Eric full_name: Berberich, Eric last_name: Berberich - first_name: Dan full_name: Halperin, Dan last_name: Halperin - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Roza full_name: Pogalnikova, Roza last_name: Pogalnikova citation: ama: Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. Discrete & Computational Geometry. 2012;48(4):964-989. doi:10.1007/s00454-012-9441-5 apa: Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-012-9441-5 chicago: Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-012-9441-5. ieee: E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete & Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012. ista: Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete & Computational Geometry. 48(4), 964–989. mla: Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5. short: E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete & Computational Geometry 48 (2012) 964–989. date_created: 2018-12-11T12:01:28Z date_published: 2012-12-01T00:00:00Z date_updated: 2023-02-23T11:22:30Z day: '01' department: - _id: HeEd doi: 10.1007/s00454-012-9441-5 external_id: arxiv: - '1109.2158' intvolume: ' 48' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1109.2158 month: '12' oa: 1 oa_version: Preprint page: 964 - 989 publication: Discrete & Computational Geometry publication_status: published publisher: Springer publist_id: '3584' quality_controlled: '1' related_material: record: - id: '3329' relation: earlier_version status: public scopus_import: 1 status: public title: Deconstructing approximate offsets type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2012' ... --- _id: '3331' abstract: - lang: eng text: Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve. author: - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Michael full_name: Sagraloff, Michael last_name: Sagraloff citation: ama: Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 2012;47(3):239-258. doi:10.1016/j.jsc.2011.11.001 apa: Kerber, M., & Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2011.11.001 chicago: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation. Elsevier, 2012. https://doi.org/10.1016/j.jsc.2011.11.001. ieee: M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012. ista: Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258. mla: Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001. short: M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258. date_created: 2018-12-11T12:02:43Z date_published: 2012-03-01T00:00:00Z date_updated: 2021-01-12T07:42:43Z day: '01' department: - _id: HeEd doi: 10.1016/j.jsc.2011.11.001 intvolume: ' 47' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.1510 month: '03' oa: 1 oa_version: Preprint page: 239 - 258 publication: ' Journal of Symbolic Computation' publication_status: published publisher: Elsevier publist_id: '3303' quality_controlled: '1' scopus_import: 1 status: public title: A worst case bound for topology computation of algebraic curves type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2012' ... --- _id: '346' abstract: - lang: eng text: Arrays of vertically aligned ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires (NWs) were prepared by means of the combination of two solution-growth processes. First, single-crystal ZnO NWs with controlled n-type doping were grown on conducting substrates by a low-cost, high-yield and seed-free electrochemical route. These NWs were covered by a titanium oxide shell of tunable thickness mediating successive adsorption-hydrolysis-condensation steps. Using this atomic-layer growth procedure, titania shells with controlled thickness and the anatase TiO2 phase were obtained after sintering at 450 °C. Higher sintering temperatures resulted in the formation of ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs by the interdiffusion of Zn and Ti ions at the ZnO–TiO2 interface. The performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs towards photoelectrochemical (PEC) water splitting was investigated as a function of the titania shell thickness. Furthermore, the performance of such core–shell NWs as photoelectrodes in dye-sensitized solar cells was also characterized. The TiO2 presence at the ZnO : Cl surface promoted a two-fold increase on the produced photocurrent densities, probing their potential for PEC and optoelectronic applications. Electrochemical impedance spectroscopy was used to corroborate the lower resistance for charge transfer between the NWs and the electrolyte in the presence of the TiO2 shell. acknowledgement: The research was supported by the European Regional Development Funds and the Spanish MICINN projects MAT2010-15138, MAT2010-21510 and CSD2009-00050. JF and AS thank the FI-DGR and BP grants from the Agència de Gestió d'Ajuts Universitaris i de Recerca (AGAUR) from the Catalan Government. MI and AC thank the Spanish MICINN for the PhD grant and the financial support through the Ramóny Cajal program. article_processing_charge: No article_type: original author: - first_name: Jiandong full_name: Fan, Jiandong last_name: Fan - first_name: Reza full_name: Zamani, Reza last_name: Zamani - first_name: Cristina full_name: Fábrega, Cristina last_name: Fábrega - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Cristina full_name: Flox, Cristina last_name: Flox - 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: Teresa full_name: Andreu, Teresa last_name: Andreu - first_name: Amtonio full_name: López, Amtonio last_name: López - 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: 'Fan J, Zamani R, Fábrega C, et al. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 2012;45(41). doi:10.1088/0022-3727/45/41/415301' apa: 'Fan, J., Zamani, R., Fábrega, C., Shavel, A., Flox, C., Ibáñez, M., … Cabot, A. (2012). Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. IOP Publishing Ltd. https://doi.org/10.1088/0022-3727/45/41/415301' chicago: 'Fan, Jiandong, Reza Zamani, Cristina Fábrega, Alexey Shavel, Cristina Flox, Maria Ibáñez, Teresa Andreu, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics. IOP Publishing Ltd., 2012. https://doi.org/10.1088/0022-3727/45/41/415301.' ieee: 'J. Fan et al., “Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness,” Journal of Physics D: Applied Physics, vol. 45, no. 41. IOP Publishing Ltd., 2012.' ista: 'Fan J, Zamani R, Fábrega C, Shavel A, Flox C, Ibáñez M, Andreu T, López A, Arbiol J, Morante J, Cabot A. 2012. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 45(41).' mla: 'Fan, Jiandong, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics, vol. 45, no. 41, IOP Publishing Ltd., 2012, doi:10.1088/0022-3727/45/41/415301.' short: 'J. Fan, R. Zamani, C. Fábrega, A. Shavel, C. Flox, M. Ibáñez, T. Andreu, A. López, J. Arbiol, J. Morante, A. Cabot, Journal of Physics D: Applied Physics 45 (2012).' date_created: 2018-12-11T11:45:56Z date_published: 2012-10-17T00:00:00Z date_updated: 2021-01-12T07:43:36Z day: '17' doi: 10.1088/0022-3727/45/41/415301 extern: '1' intvolume: ' 45' issue: '41' language: - iso: eng month: '10' oa_version: None publication: 'Journal of Physics D: Applied Physics' publication_status: published publisher: IOP Publishing Ltd. publist_id: '7486' quality_controlled: '1' status: public title: Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 45 year: '2012' ... --- _id: '3168' abstract: - lang: eng text: The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk. acknowledgement: "We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology)." author: - first_name: Jérôme full_name: Feret, Jérôme last_name: Feret - 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: Heinz full_name: Koeppl, Heinz last_name: Koeppl - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 citation: ama: Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059 apa: Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.12.059 chicago: Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.12.059. ieee: J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012. ista: Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164. mla: Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059. short: J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164. date_created: 2018-12-11T12:01:47Z date_published: 2012-05-04T00:00:00Z date_updated: 2023-02-23T11:39:40Z day: '04' department: - _id: ToHe doi: 10.1016/j.tcs.2011.12.059 intvolume: ' 431' language: - iso: eng month: '05' oa_version: None page: 137 - 164 publication: Theoretical Computer Science publication_status: published publisher: Elsevier publist_id: '3515' pubrep_id: '73' quality_controlled: '1' related_material: record: - id: '3719' relation: earlier_version status: public scopus_import: 1 status: public title: Lumpability abstractions of rule based systems type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 431 year: '2012' ... --- _id: '377' abstract: - lang: eng text: The potential to control the composition and crystal phase at the nanometer scale enable the production of nanocrystalline materials with enhanced functionalities and new applications. In the present work, we detail a novel colloidal synthesis route to prepare nanoparticles of the ternary semiconductor Cu2GeSe3 (CGSe) with nanometer-scale control over their crystal phases. We also demonstrate the structural effect on the thermoelectric properties of bottom-up-prepared CGSe nanomaterials. By careful adjustment of the nucleation and growth temperatures, pure orthorhombic CGSe nanoparticles with cationic order or polytypic CGSe nanoparticles with disordered cation positions can be produced. In this second type of nanoparticle, a high density of twins can be created to periodically change the atomic plane stacking, forming a hexagonal wurtzite CGSe phase. The high yield of the synthetic routes reported here allows the production of single-phase and multiphase CGSe nanoparticles in the gram scale, which permits characterization of the thermoelectric properties of these materials. Reduced thermal conductivities and a related 2.5-fold increase of the thermoelectric figure of merit for multiphase nanomaterials compared to pure-phase CGSe are systematically obtained. These results are discussed in terms of the density and efficiency of phonon scattering centers in both types of materials. article_processing_charge: No 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: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Stéphane full_name: Gorse, Stéphane last_name: Gorse - first_name: Nebll full_name: Katchoi, Nebll last_name: Katchoi - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Antonioo full_name: López, Antonioo last_name: López - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: 'Ibáñez M, Zamani R, Li W, et al. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 2012;24(23):4615-4622. doi:10.1021/cm303252q' apa: 'Ibáñez, M., Zamani, R., Li, W., Cadavid, D., Gorse, S., Katchoi, N., … Cabot, A. (2012). Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm303252q' chicago: 'Ibáñez, Maria, Reza Zamani, Wenhua Li, Doris Cadavid, Stéphane Gorse, Nebll Katchoi, Alexey Shavel, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials. American Chemical Society, 2012. https://doi.org/10.1021/cm303252q.' ieee: 'M. Ibáñez et al., “Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials,” Chemistry of Materials, vol. 24, no. 23. American Chemical Society, pp. 4615–4622, 2012.' ista: 'Ibáñez M, Zamani R, Li W, Cadavid D, Gorse S, Katchoi N, Shavel A, López A, Morante J, Arbiol J, Cabot A. 2012. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 24(23), 4615–4622.' mla: 'Ibáñez, Maria, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials, vol. 24, no. 23, American Chemical Society, 2012, pp. 4615–22, doi:10.1021/cm303252q.' short: M. Ibáñez, R. Zamani, W. Li, D. Cadavid, S. Gorse, N. Katchoi, A. Shavel, A. López, J. Morante, J. Arbiol, A. Cabot, Chemistry of Materials 24 (2012) 4615–4622. date_created: 2018-12-11T11:46:07Z date_published: 2012-11-14T00:00:00Z date_updated: 2021-01-12T07:52:04Z day: '14' doi: 10.1021/cm303252q extern: '1' intvolume: ' 24' issue: '23' language: - iso: eng month: '11' oa_version: None page: 4615 - 4622 publication: Chemistry of Materials publication_status: published publisher: American Chemical Society publist_id: '7452' status: public title: 'Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2012' ... --- _id: '3846' abstract: - lang: eng text: We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications. acknowledgement: This research was supported in part by the ONR grant N00014-02-1-0671, by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610. article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: 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, Henzinger TA. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 2012;78(2):394-413. doi:10.1016/j.jcss.2011.05.002 apa: Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002 chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002. ieee: K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012. ista: Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413. mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002. short: K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413. date_created: 2018-12-11T12:05:29Z date_published: 2012-03-02T00:00:00Z date_updated: 2022-05-24T08:00:54Z day: '02' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1016/j.jcss.2011.05.002 file: - access_level: open_access checksum: 241b939deb4517cdd4426d49c67e3fa2 content_type: application/pdf creator: kschuh date_created: 2019-01-29T10:54:28Z date_updated: 2020-07-14T12:46:17Z file_id: '5897' file_name: a_survey_of_stochastic_omega-regular_games.pdf file_size: 336450 relation: main_file file_date_updated: 2020-07-14T12:46:17Z has_accepted_license: '1' intvolume: ' 78' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jcss.2011.05.002 month: '03' oa: 1 oa_version: Submitted Version page: 394 - 413 publication: Journal of Computer and System Sciences publication_status: published publisher: Elsevier publist_id: '2341' quality_controlled: '1' scopus_import: '1' status: public title: A survey of stochastic ω regular games type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 78 year: '2012' ... --- _id: '387' abstract: - lang: eng text: In this Letter we present detailed study of the density of states near defects in Bi 2Se 3. In particular, we present data on the commonly found triangular defects in this system. While we do not find any measurable quasiparticle scattering interference effects, we do find localized resonances, which can be well fitted by theory once the potential is taken to be extended to properly account for the observed defects. The data together with the fits confirm that while the local density of states around the Dirac point of the electronic spectrum at the surface is significantly disrupted near the impurity by the creation of low-energy resonance state, the Dirac point is not locally destroyed. We discuss our results in terms of the expected protected surface state of topological insulators. © 2012 American Physical Society. author: - first_name: Zhanybek full_name: Alpichshev, Zhanybek id: 45E67A2A-F248-11E8-B48F-1D18A9856A87 last_name: Alpichshev orcid: 0000-0002-7183-5203 - first_name: Rudro full_name: Biswas, Rudro last_name: Biswas - first_name: Alexander full_name: Balatsky, Alexander last_name: Balatsky - first_name: James full_name: Analytis, James last_name: Analytis - first_name: Jiunhaw full_name: Chu, Jiunhaw last_name: Chu - first_name: Ian full_name: Fisher, Ian last_name: Fisher - first_name: Aharon full_name: Kapitulnik, Aharon last_name: Kapitulnik citation: ama: Alpichshev Z, Biswas R, Balatsky A, et al. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 2012;108(20). doi:10.1103/PhysRevLett.108.206402 apa: Alpichshev, Z., Biswas, R., Balatsky, A., Analytis, J., Chu, J., Fisher, I., & Kapitulnik, A. (2012). STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.108.206402 chicago: Alpichshev, Zhanybek, Rudro Biswas, Alexander Balatsky, James Analytis, Jiunhaw Chu, Ian Fisher, and Aharon Kapitulnik. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.108.206402. ieee: Z. Alpichshev et al., “STM imaging of impurity resonances on Bi 2Se 3,” Physical Review Letters, vol. 108, no. 20. American Physical Society, 2012. ista: Alpichshev Z, Biswas R, Balatsky A, Analytis J, Chu J, Fisher I, Kapitulnik A. 2012. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 108(20). mla: Alpichshev, Zhanybek, et al. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters, vol. 108, no. 20, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.206402. short: Z. Alpichshev, R. Biswas, A. Balatsky, J. Analytis, J. Chu, I. Fisher, A. Kapitulnik, Physical Review Letters 108 (2012). date_created: 2018-12-11T11:46:11Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T07:52:49Z day: '01' doi: 10.1103/PhysRevLett.108.206402 extern: '1' intvolume: ' 108' issue: '20' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1108.0022 month: '01' oa: 1 oa_version: None publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '7442' status: public title: STM imaging of impurity resonances on Bi 2Se 3 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 108 year: '2012' ... --- _id: '3110' abstract: - lang: eng text: 'The directional transport of the phytohormone auxin depends on the phosphorylation status and polar localization of PIN-FORMED (PIN) auxin efflux proteins. While PINIOD (PID) kinase is directly involved in the phosphorylation of PIN proteins, the phosphatase holoenzyme complexes that dephosphorylate PIN proteins remain elusive. Here, we demonstrate that mutations simultaneously disrupting the function of Arabidopsis thaliana FyPP1 (for Phytochrome-associated serine/threonine protein phosphatase1) and FyPP3, two homologous genes encoding the catalytic subunits of protein phosphatase6 (PP6), cause elevated accumulation of phosphorylated PIN proteins, correlating with a basal-to-apical shift in subcellular PIN localization. The changes in PIN polarity result in increased root basipetal auxin transport and severe defects, including shorter roots, fewer lateral roots, defective columella cells, root meristem collapse, abnormal cotyledons (small, cup-shaped, or fused cotyledons), and altered leaf venation. Our molecular, biochemical, and genetic data support the notion that FyPP1/3, SAL (for SAPS DOMAIN-LIKE), and PP2AA proteins (RCN1 [for ROOTS CURL IN NAPHTHYLPHTHALAMIC ACID1] or PP2AA1, PP2AA2, and PP2AA3) physically interact to form a novel PP6-type heterotrimeric holoenzyme complex. We also show that FyPP1/3, SAL, and PP2AA interact with a subset of PIN proteins and that for SAL the strength of the interaction depends on the PIN phosphorylation status. Thus, an Arabidopsis PP6-type phosphatase holoenzyme acts antagonistically with PID to direct auxin transport polarity and plant development by directly regulating PIN phosphorylation. ' author: - first_name: Mingqiu full_name: Dai, Mingqiu last_name: Dai - first_name: Chen full_name: Zhang, Chen last_name: Zhang - first_name: Urszula full_name: Urszula Kania id: 4AE5C486-F248-11E8-B48F-1D18A9856A87 last_name: Kania - first_name: Fang full_name: Chen, Fang last_name: Chen - first_name: Qin full_name: Xue, Qin last_name: Xue - first_name: Tyra full_name: McCray, Tyra last_name: Mccray - first_name: Gang full_name: Li, Gang last_name: Li - first_name: Genji full_name: Qin, Genji last_name: Qin - first_name: Michelle full_name: Wakeley, Michelle last_name: Wakeley - first_name: William full_name: Terzaghi, William last_name: Terzaghi - first_name: Jianmin full_name: Wan, Jianmin last_name: Wan - first_name: Yunde full_name: Zhao, Yunde last_name: Zhao - first_name: Jian full_name: Xu, Jian last_name: Xu - first_name: Jirí full_name: Jirí Friml id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Xing full_name: Deng, Xing W last_name: Deng - first_name: Haiyang full_name: Wang, Haiyang last_name: Wang citation: ama: Dai M, Zhang C, Kania U, et al. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 2012;24(6):2497-2514. doi:10.1105/tpc.112.098905 apa: Dai, M., Zhang, C., Kania, U., Chen, F., Xue, Q., Mccray, T., … Wang, H. (2012). A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.112.098905 chicago: Dai, Mingqiu, Chen Zhang, Urszula Kania, Fang Chen, Qin Xue, Tyra Mccray, Gang Li, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell. American Society of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.098905. ieee: M. Dai et al., “A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis,” Plant Cell, vol. 24, no. 6. American Society of Plant Biologists, pp. 2497–2514, 2012. ista: Dai M, Zhang C, Kania U, Chen F, Xue Q, Mccray T, Li G, Qin G, Wakeley M, Terzaghi W, Wan J, Zhao Y, Xu J, Friml J, Deng X, Wang H. 2012. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 24(6), 2497–2514. mla: Dai, Mingqiu, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell, vol. 24, no. 6, American Society of Plant Biologists, 2012, pp. 2497–514, doi:10.1105/tpc.112.098905. short: M. Dai, C. Zhang, U. Kania, F. Chen, Q. Xue, T. Mccray, G. Li, G. Qin, M. Wakeley, W. Terzaghi, J. Wan, Y. Zhao, J. Xu, J. Friml, X. Deng, H. Wang, Plant Cell 24 (2012) 2497–2514. date_created: 2018-12-11T12:01:27Z date_published: 2012-06-01T00:00:00Z date_updated: 2021-01-12T07:41:08Z day: '01' doi: 10.1105/tpc.112.098905 extern: 1 intvolume: ' 24' issue: '6' month: '06' page: 2497 - 2514 publication: Plant Cell publication_status: published publisher: American Society of Plant Biologists publist_id: '3589' quality_controlled: 0 status: public title: A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis type: journal_article volume: 24 year: '2012' ... --- _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 license: https://creativecommons.org/licenses/by-nc-nd/4.0/ 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' ...