[{"title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","article_number":"041903","abstract":[{"lang":"eng","text":"Living cells must control the reading out or &quot;expression&quot; 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."}],"issue":"4","date_published":"2012-04-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1112.5026"}],"date_updated":"2021-01-12T07:42:14Z","citation":{"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.","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics, 2012. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. <i> Physical Review E statistical nonlinear and soft matter physics </i>. 2012;85(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>","apa":"Tkačik, G., Walczak, A., &#38; Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>, vol. 85, no. 4, 041903, American Institute of Physics, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>.","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” <i> Physical Review E statistical nonlinear and soft matter physics </i>, vol. 85, no. 4. American Institute of Physics, 2012.","short":"G. Tkačik, A. Walczak, W. Bialek,  Physical Review E Statistical Nonlinear and Soft Matter Physics  85 (2012)."},"oa_version":"Preprint","type":"journal_article","year":"2012","volume":85,"scopus_import":1,"publisher":"American Institute of Physics","doi":"10.1103/PhysRevE.85.041903","author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Walczak, Aleksandra","first_name":"Aleksandra","last_name":"Walczak"},{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"}],"publication_status":"published","department":[{"_id":"GaTk"}],"_id":"3262","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":" Physical Review E statistical nonlinear and soft matter physics ","day":"01","date_created":"2018-12-11T12:02:20Z","status":"public","language":[{"iso":"eng"}],"month":"04","publist_id":"3386","oa":1,"quality_controlled":"1","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.","intvolume":"        85"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"3265","publisher":"IEEE","doi":"10.1109/ICCV.2011.6126486","publist_id":"3382","author":[{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian","last_name":"Ion","first_name":"Adrian"},{"full_name":"Carreira, Joao","last_name":"Carreira","first_name":"Joao"},{"full_name":"Sminchisescu, Cristian","first_name":"Cristian","last_name":"Sminchisescu"}],"publication_status":"published","department":[{"_id":"HeEd"}],"oa_version":"None","citation":{"ista":"Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>.","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>","ama":"Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.","mla":"Ion, Adrian, et al. <i>Image Segmentation by Figure-Ground Composition into Maximal Cliques</i>. 6126486, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>.","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."},"language":[{"iso":"eng"}],"type":"conference","month":"01","year":"2012","title":"Image segmentation by figure-ground composition into maximal cliques","article_number":"6126486","conference":{"end_date":"2011-11-13","name":"ICCV: International Conference on Computer Vision","start_date":"2011-11-06","location":"Barcelona, Spain"},"day":"12","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."}],"date_published":"2012-01-12T00:00:00Z","date_created":"2018-12-11T12:02:21Z","date_updated":"2021-01-12T07:42:15Z","status":"public"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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.","_id":"3274","quality_controlled":"1","intvolume":"        36","publisher":"Elsevier","doi":"10.1016/j.enganabound.2011.12.014","publist_id":"3372","author":[{"full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Rieckh"},{"first_name":"Wolfgang","last_name":"Kreuzer","full_name":"Kreuzer, Wolfgang"},{"full_name":"Waubke, Holger","last_name":"Waubke","first_name":"Holger"},{"full_name":"Balazs, Peter","last_name":"Balazs","first_name":"Peter"}],"publication_status":"published","department":[{"_id":"GaTk"}],"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. <i> Engineering Analysis with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>","apa":"Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i> Engineering Analysis with Boundary Elements</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>","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,” <i> Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i> Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>.","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs,  Engineering Analysis with Boundary Elements 36 (2012) 960–967.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil.  Engineering Analysis with Boundary Elements. 36(6), 960–967.","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i> Engineering Analysis with Boundary Elements</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>."},"oa_version":"None","language":[{"iso":"eng"}],"type":"journal_article","month":"06","scopus_import":1,"year":"2012","volume":36,"title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","publication":" Engineering Analysis with Boundary Elements","page":"960 - 967","day":"01","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."}],"date_published":"2012-06-01T00:00:00Z","issue":"6","date_created":"2018-12-11T12:02:24Z","date_updated":"2021-01-12T07:42:19Z","status":"public"},{"title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","publication":"Life on Earth and other planetary bodies","page":"387 - 405","day":"01","abstract":[{"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.","lang":"eng"}],"date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T12:02:25Z","status":"public","date_updated":"2021-01-12T07:42:20Z","citation":{"ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: <i>Life on Earth and Other Planetary Bodies</i>. Vol 24. Springer; 2012:387-405. doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>","apa":"de Vladar, H., &#38; Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In <i>Life on Earth and other planetary bodies</i> (Vol. 24, pp. 387–405). Springer. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405.","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” <i>Life on Earth and Other Planetary Bodies</i>, vol. 24, Springer, 2012, pp. 387–405, doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>.","ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in <i>Life on Earth and other planetary bodies</i>, 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.","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In <i>Life on Earth and Other Planetary Bodies</i>, 24:387–405. Springer, 2012. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>."},"oa_version":"None","language":[{"iso":"eng"}],"type":"book_chapter","month":"01","year":"2012","volume":24,"alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"publisher":"Springer","doi":"10.1007/978-94-007-4966-5_22","publist_id":"3369","author":[{"first_name":"Harold","last_name":"de Vladar","orcid":"0000-0002-5985-7653","full_name":"de Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Julian","last_name":"Chela Flores","full_name":"Chela Flores, Julian"}],"publication_status":"published","department":[{"_id":"NiBa"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3277","quality_controlled":"1","intvolume":"        24"},{"status":"public","date_created":"2018-12-11T12:02:25Z","day":"04","page":"369 - 382","conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2012-03-21","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"month":"05","language":[{"iso":"eng"}],"publist_id":"3367","intvolume":"      7194","quality_controlled":"1","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","date_updated":"2021-01-12T07:42:21Z","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"date_published":"2012-05-04T00:00:00Z","abstract":[{"text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n","lang":"eng"}],"title":"Hardness preserving constructions of pseudorandom functions","year":"2012","volume":7194,"scopus_import":1,"type":"conference","oa_version":"None","citation":{"apa":"Jain, A., Pietrzak, K. Z., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>","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.","mla":"Jain, Abhishek, et al. <i>Hardness Preserving Constructions of Pseudorandom Functions</i>. Vol. 7194, Springer, 2012, pp. 369–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>.","short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, 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.","chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>."},"department":[{"_id":"KrPi"}],"author":[{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Tentes, Aris","first_name":"Aris","last_name":"Tentes"}],"publication_status":"published","doi":"10.1007/978-3-642-28914-9_21","publisher":"Springer","alternative_title":["LNCS"],"ec_funded":1,"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"_id":"3279","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"volume":7194,"year":"2012","type":"conference","oa_version":"Submitted Version","citation":{"ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563.","chicago":"Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>.","ama":"Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>","apa":"Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.","mla":"Pietrzak, Krzysztof Z. <i>Subspace LWE</i>. Vol. 7194, Springer, 2012, pp. 548–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>.","ieee":"K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563."},"date_updated":"2021-01-12T07:42:21Z","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf"}],"date_published":"2012-05-04T00:00:00Z","abstract":[{"lang":"eng","text":"The (decisional) learning with errors problem (LWE) asks to distinguish &quot;noisy&quot; 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 &quot;subspace LWE&quot; (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. "}],"title":"Subspace LWE","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3280","department":[{"_id":"KrPi"}],"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"publication_status":"published","doi":"10.1007/978-3-642-28914-9_31","alternative_title":["LNCS"],"ec_funded":1,"publisher":"Springer","month":"05","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:26Z","day":"04","conference":{"end_date":"2012-03-21","name":"TCC: Theory of Cryptography Conference","start_date":"2012-03-19","location":"Taormina, Sicily, Italy"},"page":"548 - 563","intvolume":"      7194","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","quality_controlled":"1","oa":1,"publist_id":"3366"},{"main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"date_published":"2012-05-04T00:00:00Z","date_created":"2018-12-11T12:02:26Z","date_updated":"2021-01-12T07:42:22Z","status":"public","title":"Lossy functions do not amplify well","conference":{"end_date":"2012-03-21","name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"page":"458 - 475","day":"04","abstract":[{"lang":"eng","text":"We consider the problem of amplifying the &quot;lossiness&quot; 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 &quot;lossy functions,&quot; 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."}],"type":"conference","month":"05","year":"2012","volume":7194,"citation":{"chicago":"Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>.","ista":"Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.","ieee":"K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.","mla":"Pietrzak, Krzysztof Z., et al. <i>Lossy Functions Do Not Amplify Well</i>. Vol. 7194, Springer, 2012, pp. 458–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>.","short":"K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.","ama":"Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>","apa":"Pietrzak, K. Z., Rosen, A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>"},"oa_version":"None","language":[{"iso":"eng"}],"publication_status":"published","author":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alon","last_name":"Rosen","full_name":"Rosen, Alon"},{"last_name":"Segev","first_name":"Gil","full_name":"Segev, Gil"}],"department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"publisher":"Springer","doi":"10.1007/978-3-642-28914-9_26","publist_id":"3365","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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","_id":"3281","quality_controlled":"1","intvolume":"      7194"},{"oa":1,"has_accepted_license":"1","publist_id":"3364","file":[{"content_type":"application/pdf","creator":"system","checksum":"8557c17a8c2586d06ebfe62d934f5c5f","date_updated":"2020-07-14T12:46:06Z","file_id":"5074","date_created":"2018-12-12T10:14:23Z","file_name":"IST-2016-686-v1+1_059.pdf","access_level":"open_access","file_size":372292,"relation":"main_file"}],"intvolume":"      7237","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","file_date_updated":"2020-07-14T12:46:06Z","quality_controlled":"1","status":"public","date_created":"2018-12-11T12:02:27Z","day":"10","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2012-04-19","location":"Cambridge, UK","start_date":"2012-04-15"},"page":"355 - 374","pubrep_id":"686","month":"03","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"full_name":"Dodis, Yevgeniy","last_name":"Dodis","first_name":"Yevgeniy"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"doi":"10.1007/978-3-642-29011-4_22","alternative_title":["LNCS"],"ec_funded":1,"publisher":"Springer","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3282","date_updated":"2021-01-12T07:42:22Z","date_published":"2012-03-10T00:00:00Z","ddc":["000","004"],"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 &quot;message-hiding&quot; 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."}],"title":"Message authentication, revisited","volume":7237,"year":"2012","type":"conference","citation":{"apa":"Dodis, Y., Pietrzak, K. Z., Kiltz, E., &#38; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>","ama":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>","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.","mla":"Dodis, Yevgeniy, et al. <i>Message Authentication, Revisited</i>. Vol. 7237, Springer, 2012, pp. 355–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>.","short":"Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, 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.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>."},"oa_version":"Submitted Version"},{"year":"2012","type":"conference","month":"01","citation":{"chicago":"Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012.","ista":"Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759.","mla":"Kolmogorov, Vladimir, and Stanislav Živný. <i>The Complexity of Conservative Valued CSPs</i>. SIAM, 2012, pp. 750–59.","ieee":"V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.","short":"V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.","apa":"Kolmogorov, V., &#38; Živný, S. (2012). The complexity of conservative valued CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","ama":"Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759."},"date_updated":"2021-01-12T07:42:23Z","status":"public","date_published":"2012-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1008.1555"}],"date_created":"2018-12-11T12:02:27Z","day":"01","abstract":[{"lang":"eng","text":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.\nWe consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).\nWe prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].\nOur results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages."}],"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"title":"The complexity of conservative valued CSPs","page":"750 - 759","extern":1,"acknowledgement":"Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.","_id":"3284","quality_controlled":0,"publication_status":"published","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"},{"last_name":"Živný","first_name":"Stanislav","full_name":"Živný, Stanislav"}],"oa":1,"publist_id":"3362","publisher":"SIAM"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3289","pmid":1,"publisher":"ASM","doi":"10.1128/JVI.05638-11","author":[{"last_name":"Pereira","first_name":"Anna","full_name":"Pereira, Anna"},{"first_name":"Flávia","last_name":"Leite","full_name":"Leite, Flávia","id":"36705F98-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bruno","last_name":"Brasil","full_name":"Brasil, Bruno"},{"full_name":"Soares Martins, Jamaria","last_name":"Soares Martins","first_name":"Jamaria"},{"full_name":"Torres, Alice","last_name":"Torres","first_name":"Alice"},{"first_name":"Paulo","last_name":"Pimenta","full_name":"Pimenta, Paulo"},{"first_name":"Thais","last_name":"Souto Padrón","full_name":"Souto Padrón, Thais"},{"first_name":"Paula","last_name":"Tranktman","full_name":"Tranktman, Paula"},{"first_name":"Paulo","last_name":"Ferreira","full_name":"Ferreira, Paulo"},{"full_name":"Kroon, Erna","last_name":"Kroon","first_name":"Erna"},{"full_name":"Bonjardim, Cláudio","last_name":"Bonjardim","first_name":"Cláudio"}],"publication_status":"published","department":[{"_id":"JoBo"}],"citation":{"short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","ieee":"A. Pereira <i>et al.</i>, “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” <i>Journal of Virology</i>, vol. 86, no. 1. ASM, pp. 172–184, 2012.","mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>.","ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. 2012;86(1):172-184. doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>","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. <i>Journal of Virology</i>. ASM. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>","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.” <i>Journal of Virology</i>. ASM, 2012. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>.","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."},"oa_version":"Submitted Version","type":"journal_article","scopus_import":1,"volume":86,"year":"2012","title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","abstract":[{"text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/"}],"date_published":"2012-01-01T00:00:00Z","issue":"1","date_updated":"2021-01-12T07:42:25Z","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.","quality_controlled":"1","intvolume":"        86","external_id":{"pmid":["22031940"]},"publist_id":"3356","oa":1,"language":[{"iso":"eng"}],"month":"01","publication":"Journal of Virology","page":"172 - 184","day":"01","date_created":"2018-12-11T12:02:29Z","status":"public"},{"type":"journal_article","month":"01","article_type":"original","year":"2012","volume":134,"oa_version":"None","citation":{"short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>.","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,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., &#38; Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>","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. <i>Journal of the American Chemical Society</i>. 2012;134(3):1438-1441. doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>","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.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>.","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."},"language":[{"iso":"eng"}],"date_published":"2012-01-02T00:00:00Z","date_created":"2018-12-11T11:45:51Z","issue":"3","date_updated":"2021-01-12T07:42:29Z","status":"public","publication":"Journal of the American Chemical Society","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","page":"1438 - 1441","day":"02","abstract":[{"text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"330","article_processing_charge":"No","intvolume":"       134","extern":"1","publication_status":"published","author":[{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Carrete, Alex","first_name":"Alex","last_name":"Carrete"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"publisher":"ACS","doi":"10.1021/ja209688a","publist_id":"7531"},{"_id":"3310","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"publication_status":"published","author":[{"last_name":"Bendich","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul"},{"first_name":"Sergio","last_name":"Cabello","full_name":"Cabello, Sergio"},{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1016/j.patrec.2011.10.007","publisher":"Elsevier","volume":33,"year":"2012","scopus_import":1,"type":"journal_article","citation":{"chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>.","ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” <i>Pattern Recognition Letters</i>, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. 2012;33(11):1436-1444. doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>","apa":"Bendich, P., Cabello, S., &#38; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>"},"oa_version":"Submitted Version","date_updated":"2021-01-12T07:42:34Z","issue":"11","ddc":["000"],"date_published":"2012-08-01T00:00:00Z","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."}],"title":"A point calculus for interlevel set homology","intvolume":"        33","quality_controlled":"1","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","file_date_updated":"2020-07-14T12:46:06Z","oa":1,"publist_id":"3330","has_accepted_license":"1","file":[{"relation":"main_file","date_created":"2018-12-12T10:15:00Z","access_level":"open_access","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","file_size":280280,"checksum":"d65f79775b51258a604ca5ec741297cc","date_updated":"2020-07-14T12:46:06Z","file_id":"5116","content_type":"application/pdf","creator":"system"}],"pubrep_id":"542","month":"08","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:36Z","day":"01","page":"1436 - 1444","publication":"Pattern Recognition Letters"},{"date_published":"2012-04-01T00:00:00Z","date_created":"2018-12-11T12:02:37Z","issue":"3","date_updated":"2021-01-12T07:42:35Z","status":"public","publication":"International Journal of Foundations of Computer Science","title":"Discounting and averaging in games across time scales","page":"609 - 625","day":"01","abstract":[{"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.","lang":"eng"}],"type":"journal_article","month":"04","scopus_import":1,"year":"2012","volume":23,"oa_version":"None","citation":{"short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>.","ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","apa":"Chatterjee, K., &#38; Majumdar, R. (2012). Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>","ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. 2012;23(3):609-625. doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2012. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>.","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."},"language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"World Scientific Publishing","doi":"10.1142/S0129054112400308","publist_id":"3326","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3314","quality_controlled":"1","intvolume":"        23"},{"has_accepted_license":"1","publist_id":"3322","file":[{"content_type":"application/pdf","creator":"system","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","date_updated":"2020-07-14T12:46:07Z","file_id":"4931","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","date_created":"2018-12-12T10:12:13Z","access_level":"open_access","file_size":314246,"relation":"main_file"},{"creator":"system","content_type":"application/pdf","file_size":1840216,"access_level":"open_access","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","date_created":"2018-12-12T10:12:14Z","file_id":"4932","checksum":"bceb2efdd49d115f4dde8486bc1be3f2","date_updated":"2020-07-14T12:46:07Z","relation":"main_file"}],"oa":1,"intvolume":"        13","file_date_updated":"2020-07-14T12:46:07Z","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","quality_controlled":"1","day":"01","publication":"Nature Reviews Neuroscience","page":"7 - 21","status":"public","date_created":"2018-12-11T12:02:38Z","language":[{"iso":"eng"}],"pubrep_id":"820","month":"01","doi":"10.1038/nrn3125","publisher":"Nature Publishing Group","department":[{"_id":"PeJo"}],"publication_status":"published","author":[{"first_name":"Emmanuel","last_name":"Eggermann","full_name":"Eggermann, Emmanuel","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C"},{"first_name":"Iancu","last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A"},{"last_name":"Goswami","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit"},{"first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3317","project":[{"name":"Synaptic Mechanisms of Neuronal Network Function","grant_number":"JO_780/A5","_id":"25BC64A8-B435-11E9-9278-68D0E5697425"},{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"abstract":[{"text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission.","lang":"eng"}],"title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","date_updated":"2021-01-12T07:42:36Z","date_published":"2012-01-01T00:00:00Z","ddc":["570"],"issue":"1","oa_version":"Submitted Version","citation":{"ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21.","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>.","ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. 2012;13(1):7-21. doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>","apa":"Eggermann, E., Bucurenciu, I., Goswami, S., &#38; Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>","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,” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>.","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21."},"scopus_import":1,"volume":13,"year":"2012","type":"journal_article"},{"_id":"3331","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        47","oa":1,"author":[{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael"},{"first_name":"Michael","last_name":"Sagraloff","full_name":"Sagraloff, Michael"}],"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Elsevier","publist_id":"3303","doi":"10.1016/j.jsc.2011.11.001","month":"03","type":"journal_article","year":"2012","volume":47,"scopus_import":1,"oa_version":"Preprint","citation":{"mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>.","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","short":"M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves.  Journal of Symbolic Computation. 47(3), 239–258."},"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:43Z","issue":"3","date_published":"2012-03-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1104.1510","open_access":"1"}],"date_updated":"2021-01-12T07:42:43Z","status":"public","page":"239 - 258","publication":" Journal of Symbolic Computation","title":"A worst case bound for topology computation of algebraic curves","abstract":[{"text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with  bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.","lang":"eng"}],"day":"01"},{"title":"Robustness of structurally equivalent concurrent parity games","abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal)."}],"date_published":"2012-03-22T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"date_updated":"2023-02-23T12:23:46Z","oa_version":"Preprint","citation":{"short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>.","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>.","ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285."},"type":"conference","volume":7213,"year":"2012","scopus_import":1,"publisher":"Springer","ec_funded":1,"arxiv":1,"alternative_title":["LNCS"],"doi":"10.1007/978-3-642-28729-9_18","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"department":[{"_id":"KrCh"}],"_id":"3341","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"270 - 285","related_material":{"record":[{"relation":"earlier_version","id":"5382","status":"public"}]},"conference":{"end_date":"2012-04-01","name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2012-03-24","location":"Tallinn, Estonia"},"day":"22","date_created":"2018-12-11T12:02:46Z","status":"public","language":[{"iso":"eng"}],"month":"03","external_id":{"arxiv":["1107.2009"]},"publist_id":"3284","oa":1,"quality_controlled":"1","intvolume":"      7213"},{"publisher":"American Chemical Society (ACS)","publist_id":"7488","doi":"10.1021/cg201709c","publication_status":"published","author":[{"first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"first_name":"Wenhua","last_name":"Li","full_name":"Li, Wenhua"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"full_name":"Morante, Joan","first_name":"Joan","last_name":"Morante"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"article_processing_charge":"No","_id":"338","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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","extern":"1","intvolume":"        12","page":"1085 - 1090","publication":"Crystal Growth and Design ","title":"Extending the nanocrystal synthesis control to quaternary compositions","abstract":[{"text":"The ample chemical and structural freedom of quaternary compounds permits engineering materials that fulfill the requirements of a wide variety of applications. In this work, the mechanisms to achieve unprecedented size, shape, and composition control in quaternary nanocrystals are detailed. The described procedure allows obtaining tetrahedral and penta-tetrahedral quaternary nanocrystals with tuned size distributions and controlled compositions from a plethora of I 2-II-IV-VI 4 semiconductors.","lang":"eng"}],"day":"01","issue":"3","date_created":"2018-12-11T11:45:54Z","date_published":"2012-01-01T00:00:00Z","date_updated":"2021-01-12T07:43:05Z","status":"public","oa_version":"None","citation":{"short":"M. Ibáñez, R. Zamani, W. Li, A. Shavel, J. Arbiol, J. Morante, A. Cabot, Crystal Growth and Design  12 (2012) 1085–1090.","mla":"Ibáñez, Maria, et al. “Extending the Nanocrystal Synthesis Control to Quaternary Compositions.” <i>Crystal Growth and Design </i>, vol. 12, no. 3, American Chemical Society (ACS), 2012, pp. 1085–90, doi:<a href=\"https://doi.org/10.1021/cg201709c\">10.1021/cg201709c</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Extending the nanocrystal synthesis control to quaternary compositions,” <i>Crystal Growth and Design </i>, vol. 12, no. 3. American Chemical Society (ACS), pp. 1085–1090, 2012.","ama":"Ibáñez M, Zamani R, Li W, et al. Extending the nanocrystal synthesis control to quaternary compositions. <i>Crystal Growth and Design </i>. 2012;12(3):1085-1090. doi:<a href=\"https://doi.org/10.1021/cg201709c\">10.1021/cg201709c</a>","apa":"Ibáñez, M., Zamani, R., Li, W., Shavel, A., Arbiol, J., Morante, J., &#38; Cabot, A. (2012). Extending the nanocrystal synthesis control to quaternary compositions. <i>Crystal Growth and Design </i>. American Chemical Society (ACS). <a href=\"https://doi.org/10.1021/cg201709c\">https://doi.org/10.1021/cg201709c</a>","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.” <i>Crystal Growth and Design </i>. American Chemical Society (ACS), 2012. <a href=\"https://doi.org/10.1021/cg201709c\">https://doi.org/10.1021/cg201709c</a>.","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."},"language":[{"iso":"eng"}],"article_type":"original","month":"01","type":"journal_article","volume":12,"year":"2012"},{"author":[{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"full_name":"García Castelló, Nuria","first_name":"Nuria","last_name":"García Castelló"},{"last_name":"Izquierdo Roca","first_name":"Victora","full_name":"Izquierdo Roca, Victora"},{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"last_name":"Fairbrother","first_name":"Andrew","full_name":"Fairbrother, Andrew"},{"first_name":"Joan","last_name":"Prades","full_name":"Prades, Joan"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Pérez Rodríguez, Alejandro","first_name":"Alejandro","last_name":"Pérez Rodríguez"},{"first_name":"Joan","last_name":"Morante","full_name":"Morante, Joan"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"publication_status":"published","publisher":"American Chemical Society","publist_id":"7489","doi":"10.1021/cm2031812","_id":"339","quality_controlled":"1","article_processing_charge":"No","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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","intvolume":"        24","issue":"3","date_created":"2018-12-11T11:45:54Z","date_published":"2012-01-31T00:00:00Z","date_updated":"2021-01-12T07:43:09Z","status":"public","page":"562 - 570","publication":"Chemistry of Materials","title":"Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4","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."}],"day":"31","month":"01","article_type":"original","type":"journal_article","volume":24,"year":"2012","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. <i>Chemistry of Materials</i>. 2012;24(3):562-570. doi:<a href=\"https://doi.org/10.1021/cm2031812\">10.1021/cm2031812</a>","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. <i>Chemistry of Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/cm2031812\">https://doi.org/10.1021/cm2031812</a>","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.","mla":"Ibáñez, Maria, et al. “Composition Control and Thermoelectric Properties of Quaternary Chalcogenide Nanocrystals: The Case of Stannite Cu2CdSnSe4.” <i>Chemistry of Materials</i>, vol. 24, no. 3, American Chemical Society, 2012, pp. 562–70, doi:<a href=\"https://doi.org/10.1021/cm2031812\">10.1021/cm2031812</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4,” <i>Chemistry of Materials</i>, 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.","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.” <i>Chemistry of Materials</i>. American Chemical Society, 2012. <a href=\"https://doi.org/10.1021/cm2031812\">https://doi.org/10.1021/cm2031812</a>."},"oa_version":"None","language":[{"iso":"eng"}]},{"type":"journal_article","month":"01","article_type":"original","year":"2012","volume":134,"oa_version":"None","citation":{"short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>.","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,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., &#38; Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>","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. <i>Journal of the American Chemical Society</i>. 2012;134(3):1438-1441. doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>","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.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>.","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."},"language":[{"iso":"eng"}],"date_published":"2012-01-02T00:00:00Z","issue":"3","date_created":"2018-12-11T11:45:54Z","status":"public","date_updated":"2021-01-12T07:43:13Z","publication":"Journal of the American Chemical Society","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","page":"1438 - 1441","day":"02","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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"340","article_processing_charge":"No","intvolume":"       134","extern":"1","author":[{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Alex","last_name":"Carrete","full_name":"Carrete, Alex"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"publication_status":"published","publisher":"ACS","doi":"10.1021/ja209688a","publist_id":"7490"},{"volume":14,"year":"2012","article_type":"original","month":"12","type":"journal_article","language":[{"iso":"eng"}],"citation":{"ista":"Cadavid D, Ibáñez M, Gorsse S, López A, Cirera A, Morante J, Cabot A. 2012. Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. 14(12).","chicago":"Cadavid, Doris, Maria Ibáñez, Stéphane Gorsse, Antonio López, Albert Cirera, Joan Morante, and Andreu Cabot. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” <i>Journal of Nanoparticle Research</i>. Kluwer, 2012. <a href=\"https://doi.org/10.1007/s11051-012-1328-0\">https://doi.org/10.1007/s11051-012-1328-0</a>.","apa":"Cadavid, D., Ibáñez, M., Gorsse, S., López, A., Cirera, A., Morante, J., &#38; Cabot, A. (2012). Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. <i>Journal of Nanoparticle Research</i>. Kluwer. <a href=\"https://doi.org/10.1007/s11051-012-1328-0\">https://doi.org/10.1007/s11051-012-1328-0</a>","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. <i>Journal of Nanoparticle Research</i>. 2012;14(12). doi:<a href=\"https://doi.org/10.1007/s11051-012-1328-0\">10.1007/s11051-012-1328-0</a>","short":"D. Cadavid, M. Ibáñez, S. Gorsse, A. López, A. Cirera, J. Morante, A. Cabot, Journal of Nanoparticle Research 14 (2012).","mla":"Cadavid, Doris, et al. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” <i>Journal of Nanoparticle Research</i>, vol. 14, no. 12, Kluwer, 2012, doi:<a href=\"https://doi.org/10.1007/s11051-012-1328-0\">10.1007/s11051-012-1328-0</a>.","ieee":"D. Cadavid <i>et al.</i>, “Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe,” <i>Journal of Nanoparticle Research</i>, vol. 14, no. 12. Kluwer, 2012."},"oa_version":"None","date_updated":"2021-01-12T07:43:32Z","status":"public","issue":"12","date_created":"2018-12-11T11:45:56Z","date_published":"2012-12-01T00:00:00Z","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. "}],"day":"01","title":"Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe","publication":"Journal of Nanoparticle Research","extern":"1","intvolume":"        14","article_processing_charge":"No","_id":"345","quality_controlled":"1","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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gorsse, Stéphane","last_name":"Gorsse","first_name":"Stéphane"},{"first_name":"Antonio","last_name":"López","full_name":"López, Antonio"},{"last_name":"Cirera","first_name":"Albert","full_name":"Cirera, Albert"},{"first_name":"Joan","last_name":"Morante","full_name":"Morante, Joan"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"publication_status":"published","publist_id":"7485","doi":"10.1007/s11051-012-1328-0","publisher":"Kluwer"}]