[{"day":"11","month":"08","language":[{"iso":"eng"}],"date_published":"2014-08-11T00:00:00Z","doi":"10.1103/PhysRevLett.113.070401","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.5905"}],"citation":{"ista":"Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.","ieee":"J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol. 113, no. 7. American Physical Society, 2014.","apa":"Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401","ama":"Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401","chicago":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401.","mla":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.","short":"J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014)."},"oa":1,"publication":"Physical Review Letters","extern":"1","publist_id":"4884","issue":"7","abstract":[{"text":"We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein condensates with non-local interactions. The scheme relies on the use of momentum-dependent dark-states in close analogy to velocity-selective coherent population trapping. During the short-time dissipative dynamics, the system is driven into a particular finite-momentum phonon mode, which in real space corresponds to an ordered structure with non-local density-density correlations. Dissipation-induced ordering can be observed and studied in present-day experiments using cold atoms with dipole-dipole or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering does not require artificial breaking of translational symmetry by an opticallattice or harmonic trap. This opens up a perspective of direct cooling of quantum gases into strongly-interacting phases.","lang":"eng"}],"type":"journal_article","article_number":"070401","volume":113,"oa_version":"Submitted Version","date_updated":"2021-01-12T06:55:33Z","date_created":"2018-12-11T11:55:56Z","author":[{"full_name":"Otterbach, Johannes","first_name":"Johannes","last_name":"Otterbach"},{"full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"American Physical Society","intvolume":" 113","status":"public","publication_status":"published","title":"Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2140","acknowledgement":"This work was supported by NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.","year":"2014"},{"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","start_date":"2014-06-08","end_date":"2014-06-11"},"date_published":"2014-06-01T00:00:00Z","doi":"10.1145/2582112.2582168","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","citation":{"short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:355-364. doi:10.1145/2582112.2582168","apa":"Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Annual Symposium on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 355–364.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}],"oa":1,"quality_controlled":"1","page":"355 - 364","project":[{"name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"month":"06","day":"01","scopus_import":1,"author":[{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich"},{"first_name":"Michael","last_name":"Lesnick","full_name":"Lesnick, Michael"}],"date_created":"2018-12-11T11:56:01Z","date_updated":"2021-01-12T06:55:38Z","oa_version":"Submitted Version","year":"2014","_id":"2153","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Induced matchings of barcodes and the algebraic stability of persistence","status":"public","department":[{"_id":"HeEd"}],"publisher":"ACM","abstract":[{"lang":"eng","text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s)."}],"ec_funded":1,"publist_id":"4853","type":"conference"},{"publication":"Discrete & Computational Geometry","citation":{"ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.","apa":"Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 52(1), 1–33.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9584-7.","short":"J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:10.1007/s00454-014-9584-7."},"page":"1 - 33","date_published":"2014-07-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2154","status":"public","title":"On Gromov's method of selecting heavily covered points","intvolume":" 52","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd."}],"issue":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1102.3515","open_access":"1"}],"quality_controlled":"1","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"doi":"10.1007/s00454-014-9584-7","language":[{"iso":"eng"}],"month":"07","acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","year":"2014","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"}],"date_updated":"2021-01-12T06:55:38Z","date_created":"2018-12-11T11:56:01Z","volume":52,"publist_id":"4852"},{"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2156","status":"public","title":"Measuring distance between Reeb graphs","abstract":[{"lang":"eng","text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s)."}],"type":"conference","date_published":"2014-06-01T00:00:00Z","publication":"Proceedings of the Annual Symposium on Computational Geometry","citation":{"chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In Proceedings of the Annual Symposium on Computational Geometry, 464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169.","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 464–473.","apa":"Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169"},"page":"464 - 473","day":"01","scopus_import":1,"author":[{"orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"full_name":"Ge, Xiaoyin","last_name":"Ge","first_name":"Xiaoyin"},{"first_name":"Yusu","last_name":"Wang","full_name":"Wang, Yusu"}],"date_created":"2018-12-11T11:56:02Z","date_updated":"2021-01-12T06:55:39Z","acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","year":"2014","publication_status":"published","publisher":"ACM","department":[{"_id":"HeEd"}],"publist_id":"4850","ec_funded":1,"conference":{"start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.1145/2582112.2582169","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.2839"}],"quality_controlled":"1","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems"}],"month":"06"},{"month":"06","quality_controlled":"1","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1312.1231","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.1145/2582112.2582167","ec_funded":1,"publist_id":"4851","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"ACM","acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","year":"2014","date_updated":"2021-01-12T06:55:38Z","date_created":"2018-12-11T11:56:01Z","author":[{"full_name":"Bauer, Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","first_name":"Ulrich","last_name":"Bauer"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"scopus_import":1,"day":"01","page":"484 - 490","publication":"Proceedings of the Annual Symposium on Computational Geometry","citation":{"ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:484-490. doi:10.1145/2582112.2582167","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490.","apa":"Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167."},"date_published":"2014-06-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s)."}],"title":"The morse theory of Čech and Delaunay filtrations","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2155","oa_version":"Submitted Version"},{"day":"01","scopus_import":1,"date_published":"2014-10-01T00:00:00Z","publication":"Current Opinion in Cell Biology","citation":{"ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","apa":"Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” Current Opinion in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010.","mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40."},"page":"33 - 40","abstract":[{"text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Submitted Version","_id":"2158","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","status":"public","intvolume":" 30","month":"10","doi":"10.1016/j.ceb.2014.05.010","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/","open_access":"1"}],"oa":1,"external_id":{"pmid":["24959970"]},"quality_controlled":"1","publist_id":"4848","author":[{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"},{"full_name":"Parent, Carole","last_name":"Parent","first_name":"Carole"}],"date_created":"2018-12-11T11:56:03Z","date_updated":"2021-01-12T06:55:40Z","volume":30,"year":"2014","acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"MiSi"}]},{"title":"Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling","status":"public","publication_status":"published","publisher":"Elsevier","intvolume":" 51","year":"2014","_id":"2165","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:43Z","date_created":"2018-12-11T11:56:05Z","oa_version":"Submitted Version","volume":51,"author":[{"full_name":"Morvant, Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","last_name":"Morvant","first_name":"Emilie"}],"type":"journal_article","extern":"1","abstract":[{"text":"In machine learning, the domain adaptation problem arrives when the test (tar-get) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classification models defined as a weighted majority vote over a set of real-valued functions. In this context, Germain et al. (2013) have shown that a measure of disagreement between these functions is crucial to control. The core of this measure is a theoretical bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads to a well performing majority vote learn-ing algorithm in usual non-adaptative supervised setting: MinCq. In this work,we propose a framework to extend MinCq to a domain adaptation scenario.This procedure takes advantage of the recent perturbed variation divergence between distributions proposed by Harel and Mannor (2012). Justified by a theoretical bound on the target risk of the vote, we provide to MinCq a tar-get sample labeled thanks to a perturbed variation-based self-labeling focused on the regions where the source and target marginals appear similar. We also study the influence of our self-labeling, from which we deduce an original process for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very promising results on a rotation and translation synthetic problem.","lang":"eng"}],"ec_funded":1,"publist_id":"4819","quality_controlled":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"page":"37-43","publication":"Pattern Recognition Letters","main_file_link":[{"url":"http://arxiv.org/abs/1410.0334","open_access":"1"}],"citation":{"mla":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters, vol. 51, Elsevier, 2014, pp. 37–43, doi:10.1016/j.patrec.2014.08.013.","short":"E. Morvant, Pattern Recognition Letters 51 (2014) 37–43.","chicago":"Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters. Elsevier, 2014. https://doi.org/10.1016/j.patrec.2014.08.013.","ama":"Morvant E. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 2014;51:37-43. doi:10.1016/j.patrec.2014.08.013","ista":"Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43.","apa":"Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2014.08.013","ieee":"E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling,” Pattern Recognition Letters, vol. 51. Elsevier, pp. 37–43, 2014."},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.patrec.2014.08.013","date_published":"2014-10-01T00:00:00Z","month":"10","day":"01"},{"quality_controlled":"1","page":"2130 - 2140","publication":"Cerebral Cortex","citation":{"ama":"Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 2014;24(8):2130-2140. doi:10.1093/cercor/bht067","ista":"Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 24(8), 2130–2140.","ieee":"X. Chai et al., “Epilepsy-induced motility of differentiated neurons,” Cerebral Cortex, vol. 24, no. 8. Oxford University Press, pp. 2130–2140, 2014.","apa":"Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., … Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bht067","mla":"Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.” Cerebral Cortex, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40, doi:10.1093/cercor/bht067.","short":"X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young, C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.","chicago":"Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski, Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced Motility of Differentiated Neurons.” Cerebral Cortex. Oxford University Press, 2014. https://doi.org/10.1093/cercor/bht067."},"language":[{"iso":"eng"}],"doi":"10.1093/cercor/bht067","date_published":"2014-08-01T00:00:00Z","scopus_import":1,"day":"01","month":"08","status":"public","title":"Epilepsy-induced motility of differentiated neurons","publication_status":"published","intvolume":" 24","publisher":"Oxford University Press","department":[{"_id":"PeJo"}],"_id":"2164","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014","date_updated":"2021-01-12T06:55:43Z","date_created":"2018-12-11T11:56:04Z","oa_version":"None","volume":24,"author":[{"first_name":"Xuejun","last_name":"Chai","full_name":"Chai, Xuejun"},{"last_name":"Münzner","first_name":"Gert","full_name":"Münzner, Gert"},{"first_name":"Shanting","last_name":"Zhao","full_name":"Zhao, Shanting"},{"last_name":"Tinnes","first_name":"Stefanie","full_name":"Tinnes, Stefanie"},{"id":"3F3CA136-F248-11E8-B48F-1D18A9856A87","last_name":"Kowalski","first_name":"Janina","full_name":"Kowalski, Janina"},{"last_name":"Häussler","first_name":"Ute","full_name":"Häussler, Ute"},{"first_name":"Christina","last_name":"Young","full_name":"Young, Christina"},{"last_name":"Haas","first_name":"Carola","full_name":"Haas, Carola"},{"full_name":"Frotscher, Michael","last_name":"Frotscher","first_name":"Michael"}],"type":"journal_article","abstract":[{"text":"Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe epilepsy (TLE), has been assumed to result from a migration defect during development. Indeed, recent studies reported that aberrant migration of neonatal-generated dentate granule cells (GCs) increased the risk to develop epilepsy later in life. On the contrary, in the present study, we show that fully differentiated GCs become motile following the induction of epileptiform activity, resulting in GCD. Hippocampal slice cultures from transgenic mice expressing green fluorescent protein in differentiated, but not in newly generated GCs, were incubated with the glutamate receptor agonist kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy, we observed that KA-exposed, differentiated GCs translocated their cell bodies and changed their dendritic organization. As found in human TLE, KA application was associated with decreased expression of the extracellular matrix protein Reelin, particularly in hilar interneurons. Together these findings suggest that KA-induced motility of differentiated GCs contributes to the development of GCD and establish slice cultures as a model to study neuronal changes induced by epileptiform activity. ","lang":"eng"}],"publist_id":"4820","issue":"8"},{"publisher":"Academic Press","department":[{"_id":"NiBa"}],"publication_status":"published","year":"2014","volume":95,"date_updated":"2021-01-12T06:55:44Z","date_created":"2018-12-11T11:56:06Z","author":[{"last_name":"Kelleher","first_name":"Jerome","full_name":"Kelleher, Jerome"},{"last_name":"Etheridge","first_name":"Alison","full_name":"Etheridge, Alison"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"publist_id":"4816","file_date_updated":"2020-07-14T12:45:31Z","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1016/j.tpb.2014.05.001","month":"08","intvolume":" 95","title":"Coalescent simulation in continuous space: Algorithms for large neighbourhood size","ddc":["570"],"status":"public","_id":"2168","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_name":"IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf","creator":"system","file_size":569005,"content_type":"application/pdf","file_id":"4839","relation":"main_file","checksum":"979d7a8034e9df198f068f0d251f31bd","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:10:49Z"}],"oa_version":"Published Version","pubrep_id":"391","type":"journal_article","abstract":[{"lang":"eng","text":"Many species have an essentially continuous distribution in space, in which there are no natural divisions between randomly mating subpopulations. Yet, the standard approach to modelling these populations is to impose an arbitrary grid of demes, adjusting deme sizes and migration rates in an attempt to capture the important features of the population. Such indirect methods are required because of the failure of the classical models of isolation by distance, which have been shown to have major technical flaws. A recently introduced model of extinction and recolonisation in two dimensions solves these technical problems, and provides a rigorous technical foundation for the study of populations evolving in a spatial continuum. The coalescent process for this model is simply stated, but direct simulation is very inefficient for large neighbourhood sizes. We present efficient and exact algorithms to simulate this coalescent process for arbitrary sample sizes and numbers of loci, and analyse these algorithms in detail."}],"page":"13 - 23","citation":{"apa":"Kelleher, J., Etheridge, A., & Barton, N. H. (2014). Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2014.05.001","ieee":"J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous space: Algorithms for large neighbourhood size,” Theoretical Population Biology, vol. 95. Academic Press, pp. 13–23, 2014.","ista":"Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. 95, 13–23.","ama":"Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. 2014;95:13-23. doi:10.1016/j.tpb.2014.05.001","chicago":"Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical Population Biology. Academic Press, 2014. https://doi.org/10.1016/j.tpb.2014.05.001.","short":"J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95 (2014) 13–23.","mla":"Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical Population Biology, vol. 95, Academic Press, 2014, pp. 13–23, doi:10.1016/j.tpb.2014.05.001."},"publication":"Theoretical Population Biology","date_published":"2014-08-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01"},{"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1410107111","date_published":"2014-07-22T00:00:00Z","page":"10398 - 10399","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/"}],"citation":{"short":"N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.","mla":"Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer Science.” PNAS, vol. 111, no. 29, National Academy of Sciences, 2014, pp. 10398–99, doi:10.1073/pnas.1410107111.","chicago":"Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of Selection in Evolution and Computer Science.” PNAS. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1410107111.","ama":"Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer science. PNAS. 2014;111(29):10398-10399. doi:10.1073/pnas.1410107111","ieee":"N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution and computer science,” PNAS, vol. 111, no. 29. National Academy of Sciences, pp. 10398–10399, 2014.","apa":"Barton, N. H., Novak, S., & Paixao, T. (2014). Diverse forms of selection in evolution and computer science. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1410107111","ista":"Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution and computer science. PNAS. 111(29), 10398–10399."},"oa":1,"publication":"PNAS","month":"07","day":"22","scopus_import":1,"volume":111,"oa_version":"Submitted Version","date_updated":"2021-01-12T06:55:45Z","date_created":"2018-12-11T11:56:07Z","author":[{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novak","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian"},{"id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","first_name":"Tiago","last_name":"Paixao","full_name":"Paixao, Tiago"}],"intvolume":" 111","department":[{"_id":"NiBa"}],"publisher":"National Academy of Sciences","publication_status":"published","status":"public","title":"Diverse forms of selection in evolution and computer science","_id":"2169","year":"2014","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","issue":"29","publist_id":"4815","type":"journal_article"},{"scopus_import":1,"day":"01","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","citation":{"chicago":"Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer, 2014. https://doi.org/10.1007/978-3-319-10578-9_36.","short":"A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla, B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 550–565.","mla":"Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65, doi:10.1007/978-3-319-10578-9_36.","ieee":"A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate CRF training for scalable image segmentation,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Zurich, Switzerland, 2014, vol. 8691, no. PART 3, pp. 550–565.","apa":"Kolesnikov, A., Guillaumin, M., Ferrari, V., & Lampert, C. (2014). Closed-form approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla, B. Schiele, & T. Tuytelaars (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. https://doi.org/10.1007/978-3-319-10578-9_36","ista":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate CRF training for scalable image segmentation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691, 550–565.","ama":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B, Tuytelaars T, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8691. Springer; 2014:550-565. doi:10.1007/978-3-319-10578-9_36"},"page":"550 - 565","date_published":"2014-09-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We present LS-CRF, a new method for training cyclic Conditional Random Fields (CRFs) from large datasets that is inspired by classical closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. Training a CRF with LS-CRF requires only solving a set of independent regression problems, each of which can be solved efficiently in closed form or by an iterative solver. This makes LS-CRF orders of magnitude faster than classical CRF training based on probabilistic inference, and at the same time more flexible and easier to implement than other approximate techniques, such as pseudolikelihood or piecewise training. We apply LS-CRF to the task of semantic image segmentation, showing that it achieves on par accuracy to other training techniques at higher speed, thereby allowing efficient CRF training from very large training sets. For example, training a linearly parameterized pairwise CRF on 150,000 images requires less than one hour on a modern workstation.","lang":"eng"}],"issue":"PART 3","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2171","status":"public","title":"Closed-form approximate CRF training for scalable image segmentation","intvolume":" 8691","oa_version":"Submitted Version","month":"09","main_file_link":[{"url":"http://arxiv.org/abs/1403.7057","open_access":"1"}],"oa":1,"quality_controlled":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"conference":{"name":"ECCV: European Conference on Computer Vision","end_date":"2014-09-12","location":"Zurich, Switzerland","start_date":"2014-09-06"},"doi":"10.1007/978-3-319-10578-9_36","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"4813","year":"2014","publication_status":"published","department":[{"_id":"ChLa"}],"editor":[{"full_name":"Fleet, David","first_name":"David","last_name":"Fleet"},{"full_name":"Pajdla, Tomas","first_name":"Tomas","last_name":"Pajdla"},{"full_name":"Schiele, Bernt","last_name":"Schiele","first_name":"Bernt"},{"full_name":"Tuytelaars, Tinne","last_name":"Tuytelaars","first_name":"Tinne"}],"publisher":"Springer","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander"},{"last_name":"Guillaumin","first_name":"Matthieu","full_name":"Guillaumin, Matthieu"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"date_updated":"2021-01-12T06:55:46Z","date_created":"2018-12-11T11:56:07Z","volume":8691},{"month":"09","conference":{"name":"BMVC: British Machine Vision Conference","end_date":"2014-09-05","start_date":"2014-09-01","location":"Nottingham, UK"},"language":[{"iso":"eng"}],"oa":1,"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"quality_controlled":"1","publist_id":"4811","ec_funded":1,"file_date_updated":"2020-07-14T12:45:31Z","author":[{"full_name":"Khamis, Sameh","first_name":"Sameh","last_name":"Khamis"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"date_created":"2018-12-11T11:56:08Z","date_updated":"2021-01-12T06:55:46Z","year":"2014","publisher":"BMVA Press","department":[{"_id":"ChLa"}],"publication_status":"published","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2014-09-01T00:00:00Z","citation":{"ista":"Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization. Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine Vision Conference.","apa":"Khamis, S., & Lampert, C. (2014). CoConut: Co-classification with output space regularization. In Proceedings of the British Machine Vision Conference 2014. Nottingham, UK: BMVA Press.","ieee":"S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,” in Proceedings of the British Machine Vision Conference 2014, Nottingham, UK, 2014.","ama":"Khamis S, Lampert C. CoConut: Co-classification with output space regularization. In: Proceedings of the British Machine Vision Conference 2014. BMVA Press; 2014.","chicago":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” In Proceedings of the British Machine Vision Conference 2014. BMVA Press, 2014.","mla":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” Proceedings of the British Machine Vision Conference 2014, BMVA Press, 2014.","short":"S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2014, BMVA Press, 2014."},"publication":"Proceedings of the British Machine Vision Conference 2014","abstract":[{"lang":"eng","text":"In this work we introduce a new approach to co-classification, i.e. the task of jointly classifying multiple, otherwise independent, data samples. The method we present, named CoConut, is based on the idea of adding a regularizer in the label space to encode certain priors on the resulting labelings. A regularizer that encourages labelings that are smooth across the test set, for instance, can be seen as a test-time variant of the cluster assumption, which has been proven useful at training time in semi-supervised learning. A regularizer that introduces a preference for certain class proportions can be regarded as a prior distribution on the class labels. CoConut can build on existing classifiers without making any assumptions on how they were obtained and without the need to re-train them. The use of a regularizer adds a new level of flexibility. It allows the integration of potentially new information at test time, even in other modalities than what the classifiers were trained on. We evaluate our framework on six datasets, reporting a clear performance gain in classification accuracy compared to the standard classification setup that predicts labels for each test sample separately.\r\n"}],"type":"conference","pubrep_id":"490","file":[{"checksum":"c4c6d3efdb8ee648faf3e76849839ce2","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:08:23Z","relation":"main_file","file_id":"4683","content_type":"application/pdf","file_size":408172,"creator":"system","access_level":"open_access","file_name":"IST-2016-490-v1+1_khamis-bmvc2014.pdf"}],"oa_version":"Published Version","_id":"2173","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"CoConut: Co-classification with output space regularization","status":"public","ddc":["000"]},{"author":[{"last_name":"Sydorov","first_name":"Vladyslav","full_name":"Sydorov, Vladyslav"},{"full_name":"Sakurada, Mayu","last_name":"Sakurada","first_name":"Mayu"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"date_created":"2018-12-11T11:56:08Z","date_updated":"2021-01-12T06:55:46Z","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2172","year":"2014","status":"public","publication_status":"published","title":"Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters","department":[{"_id":"ChLa"}],"publisher":"IEEE","abstract":[{"lang":"eng","text":"Fisher Kernels and Deep Learning were two developments with significant impact on large-scale object categorization in the last years. Both approaches were shown to achieve state-of-the-art results on large-scale object categorization datasets, such as ImageNet. Conceptually, however, they are perceived as very different and it is not uncommon for heated debates to spring up when advocates of both paradigms meet at conferences or workshops. In this work, we emphasize the similarities between both architectures rather than their differences and we argue that such a unified view allows us to transfer ideas from one domain to the other. As a concrete example we introduce a method for learning a support vector machine classifier with Fisher kernel at the same time as a task-specific data representation. We reinterpret the setting as a multi-layer feed forward network. Its final layer is the classifier, parameterized by a weight vector, and the two previous layers compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture model. We introduce a gradient descent based learning algorithm that, in contrast to other feature learning techniques, is not just derived from intuition or biological analogy, but has a theoretical justification in the framework of statistical learning theory. Our experiments show that the new training procedure leads to significant improvements in classification accuracy while preserving the modularity and geometric interpretability of a support vector machine setup."}],"publist_id":"4812","ec_funded":1,"type":"conference","conference":{"location":"Columbus, USA","start_date":"2014-06-23","end_date":"2014-06-28","name":"CVPR: Computer Vision and Pattern Recognition"},"doi":"10.1109/CVPR.2014.182","date_published":"2014-09-24T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","citation":{"short":"V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–1409.","mla":"Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–09, doi:10.1109/CVPR.2014.182.","chicago":"Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1402–9. IEEE, 2014. https://doi.org/10.1109/CVPR.2014.182.","ama":"Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE; 2014:1402-1409. doi:10.1109/CVPR.2014.182","apa":"Sydorov, V., Sakurada, M., & Lampert, C. (2014). Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 1402–1409). Columbus, USA: IEEE. https://doi.org/10.1109/CVPR.2014.182","ieee":"V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Columbus, USA, 2014, pp. 1402–1409.","ista":"Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer Vision and Pattern Recognition, 1402–1409."},"quality_controlled":"1","project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"page":"1402 - 1409","month":"09","day":"24","scopus_import":1},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.1017"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"doi":"10.1534/genetics.113.159111","language":[{"iso":"eng"}],"month":"06","year":"2014","publication_status":"published","publisher":"Genetics Society of America","department":[{"_id":"NiBa"}],"author":[{"full_name":"De Vladar, Harold","first_name":"Harold","last_name":"De Vladar"},{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:56:08Z","date_updated":"2021-01-12T06:55:47Z","volume":197,"publist_id":"4809","ec_funded":1,"publication":"Genetics","citation":{"ama":"De Vladar H, Barton NH. Stability and response of polygenic traits to stabilizing selection and mutation. Genetics. 2014;197(2):749-767. doi:10.1534/genetics.113.159111","apa":"De Vladar, H., & Barton, N. H. (2014). Stability and response of polygenic traits to stabilizing selection and mutation. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.113.159111","ieee":"H. De Vladar and N. H. Barton, “Stability and response of polygenic traits to stabilizing selection and mutation,” Genetics, vol. 197, no. 2. Genetics Society of America, pp. 749–767, 2014.","ista":"De Vladar H, Barton NH. 2014. Stability and response of polygenic traits to stabilizing selection and mutation. Genetics. 197(2), 749–767.","short":"H. De Vladar, N.H. Barton, Genetics 197 (2014) 749–767.","mla":"De Vladar, Harold, and Nicholas H. Barton. “Stability and Response of Polygenic Traits to Stabilizing Selection and Mutation.” Genetics, vol. 197, no. 2, Genetics Society of America, 2014, pp. 749–67, doi:10.1534/genetics.113.159111.","chicago":"De Vladar, Harold, and Nicholas H Barton. “Stability and Response of Polygenic Traits to Stabilizing Selection and Mutation.” Genetics. Genetics Society of America, 2014. https://doi.org/10.1534/genetics.113.159111."},"page":"749 - 767","date_published":"2014-06-01T00:00:00Z","scopus_import":1,"day":"01","_id":"2174","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Stability and response of polygenic traits to stabilizing selection and mutation","intvolume":" 197","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"When polygenic traits are under stabilizing selection, many different combinations of alleles allow close adaptation to the optimum. If alleles have equal effects, all combinations that result in the same deviation from the optimum are equivalent. Furthermore, the genetic variance that is maintained by mutation-selection balance is 2μ/S per locus, where μ is the mutation rate and S the strength of stabilizing selection. In reality, alleles vary in their effects, making the fitness landscape asymmetric and complicating analysis of the equilibria. We show that that the resulting genetic variance depends on the fraction of alleles near fixation, which contribute by 2μ/S, and on the total mutational effects of alleles that are at intermediate frequency. The inpplayfi between stabilizing selection and mutation leads to a sharp transition: alleles with effects smaller than a threshold value of 2 remain polymorphic, whereas those with larger effects are fixed. The genetic load in equilibrium is less than for traits of equal effects, and the fitness equilibria are more similar. We find p the optimum is displaced, alleles with effects close to the threshold value sweep first, and their rate of increase is bounded by Long-term response leads in general to well-adapted traits, unlike the case of equal effects that often end up at a suboptimal fitness peak. However, the particular peaks to which the populations converge are extremely sensitive to the initial states and to the speed of the shift of the optimum trait value.","lang":"eng"}],"issue":"2"},{"day":"09","has_accepted_license":"1","scopus_import":1,"date_published":"2014-06-09T00:00:00Z","publication":"Electronic Communications in Probability","citation":{"ama":"Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 2014;19. doi:10.1214/ECP.v19-3121","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2014). Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v19-3121","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive variance matrix,” Electronic Communications in Probability, vol. 19. Institute of Mathematical Statistics, 2014.","ista":"Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 19.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability 19 (2014).","mla":"Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.” Electronic Communications in Probability, vol. 19, Institute of Mathematical Statistics, 2014, doi:10.1214/ECP.v19-3121.","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle Law with Imprimitive Variance Matrix.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2014. https://doi.org/10.1214/ECP.v19-3121."},"abstract":[{"text":"We extend the proof of the local semicircle law for generalized Wigner matrices given in MR3068390 to the case when the matrix of variances has an eigenvalue -1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where the variances of the entries of X may vary.","lang":"eng"}],"type":"journal_article","pubrep_id":"426","file":[{"date_created":"2018-12-12T10:09:06Z","date_updated":"2020-07-14T12:45:31Z","checksum":"bd8a041c76d62fe820bf73ff13ce7d1b","file_id":"4729","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":327322,"file_name":"IST-2016-426-v1+1_3121-17518-1-PB.pdf","access_level":"open_access"}],"oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2179","title":"Local semicircle law with imprimitive variance matrix","status":"public","ddc":["570"],"intvolume":" 19","month":"06","doi":"10.1214/ECP.v19-3121","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:31Z","publist_id":"4803","author":[{"last_name":"Ajanki","first_name":"Oskari H","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","full_name":"Ajanki, Oskari H"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"last_name":"Krüger","first_name":"Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H"}],"date_created":"2018-12-11T11:56:10Z","date_updated":"2021-01-12T06:55:48Z","volume":19,"year":"2014","publication_status":"published","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}]},{"day":"29","month":"05","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2014-05-29T00:00:00Z","doi":"10.1038/nprot.2014.099","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"page":"1480 - 1495","quality_controlled":"1","citation":{"ama":"Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. Nature Protocols. 2014;9(6):1480-1495. doi:10.1038/nprot.2014.099","ieee":"D. Studer et al., “Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue,” Nature Protocols, vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014.","apa":"Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., & Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. Nature Protocols. Nature Publishing Group. https://doi.org/10.1038/nprot.2014.099","ista":"Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.","short":"D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher, Nature Protocols 9 (2014) 1480–1495.","mla":"Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols, vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:10.1038/nprot.2014.099.","chicago":"Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber, Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols. Nature Publishing Group, 2014. https://doi.org/10.1038/nprot.2014.099."},"publication":"Nature Protocols","publist_id":"4807","issue":"6","abstract":[{"lang":"eng","text":"Electron microscopy (EM) allows for the simultaneous visualization of all tissue components at high resolution. However, the extent to which conventional aldehyde fixation and ethanol dehydration of the tissue alter the fine structure of cells and organelles, thereby preventing detection of subtle structural changes induced by an experiment, has remained an issue. Attempts have been made to rapidly freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue under high pressure (high-pressure freezing, HPF) followed by cryosubstitution of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells, organelles and molecules is preserved. Here we describe a protocol for HPF that is useful to monitor ultrastructural changes associated with functional changes at synapses in the brain but can be applied to many other tissues as well. The procedure requires a high-pressure freezer and takes a minimum of 7 d but can be paused at several points."}],"type":"journal_article","volume":9,"oa_version":"None","date_created":"2018-12-11T11:56:09Z","date_updated":"2021-01-12T06:55:47Z","author":[{"full_name":"Studer, Daniel","last_name":"Studer","first_name":"Daniel"},{"full_name":"Zhao, Shanting","last_name":"Zhao","first_name":"Shanting"},{"last_name":"Chai","first_name":"Xuejun","full_name":"Chai, Xuejun"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas"},{"last_name":"Graber","first_name":"Werner","full_name":"Graber, Werner"},{"first_name":"Sigrun","last_name":"Nestel","full_name":"Nestel, Sigrun"},{"full_name":"Frotscher, Michael","last_name":"Frotscher","first_name":"Michael"}],"publisher":"Nature Publishing Group","department":[{"_id":"PeJo"}],"intvolume":" 9","publication_status":"published","title":"Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue","status":"public","_id":"2176","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014"},{"publist_id":"4804","date_created":"2018-12-11T11:56:10Z","date_updated":"2021-01-12T06:55:48Z","volume":55,"author":[{"first_name":"David","last_name":"Haws","full_name":"Haws, David"},{"full_name":"Martin Del Campo Sanchez, Abraham","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham","last_name":"Martin Del Campo Sanchez"},{"full_name":"Takemura, Akimichi","last_name":"Takemura","first_name":"Akimichi"},{"last_name":"Yoshida","first_name":"Ruriko","full_name":"Yoshida, Ruriko"}],"publication_status":"published","department":[{"_id":"CaUh"}],"publisher":"Springer","acknowledgement":"Research of Martín del Campo supported in part by NSF Grant DMS-915211.","year":"2014","month":"03","language":[{"iso":"eng"}],"doi":"10.1007/s13366-013-0178-y","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.3070"}],"oa":1,"abstract":[{"lang":"eng","text":"We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time T, the size of the design matrix is 6 × 3 · 2T-1 and the convex hull of its columns is the model polytope. We study the behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets for all T ≥ 5. Moreover, we give a complete description of these facets. From this, we deduce that the toric ideal associated with the design matrix is generated by binomials of degree at most 6. Our proof is based on a result due to Sturmfels, who gave a bound on the degree of the generators of a toric ideal, provided the normality of the corresponding toric variety. In our setting, we established the normality of the toric variety associated to the THMC model by studying the geometric properties of the model polytope."}],"issue":"1","type":"journal_article","oa_version":"Submitted Version","title":"Markov degree of the three-state toric homogeneous Markov chain model","status":"public","intvolume":" 55","_id":"2178","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2014-03-01T00:00:00Z","page":"161 - 188","publication":"Beitrage zur Algebra und Geometrie","citation":{"short":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur Algebra Und Geometrie 55 (2014) 161–188.","mla":"Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” Beitrage Zur Algebra Und Geometrie, vol. 55, no. 1, Springer, 2014, pp. 161–88, doi:10.1007/s13366-013-0178-y.","chicago":"Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” Beitrage Zur Algebra Und Geometrie. Springer, 2014. https://doi.org/10.1007/s13366-013-0178-y.","ama":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 2014;55(1):161-188. doi:10.1007/s13366-013-0178-y","apa":"Haws, D., Martin del Campo Sanchez, A., Takemura, A., & Yoshida, R. (2014). Markov degree of the three-state toric homogeneous Markov chain model. Beitrage Zur Algebra Und Geometrie. Springer. https://doi.org/10.1007/s13366-013-0178-y","ieee":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov degree of the three-state toric homogeneous Markov chain model,” Beitrage zur Algebra und Geometrie, vol. 55, no. 1. Springer, pp. 161–188, 2014.","ista":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 55(1), 161–188."}},{"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Parsa, Salman","first_name":"Salman","last_name":"Parsa","id":"4BDBD4F2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","date_created":"2018-12-11T11:56:09Z","date_updated":"2021-01-12T06:55:48Z","year":"2014","_id":"2177","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"SIAM","department":[{"_id":"HeEd"}],"publication_status":"published","title":"On the computational complexity of betti numbers reductions from matrix rank","status":"public","publist_id":"4805","abstract":[{"text":"We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity.","lang":"eng"}],"type":"conference","doi":"10.1137/1.9781611973402.11","date_published":"2014-01-01T00:00:00Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2014-01-05","location":"Portland, USA","end_date":"2014-01-07"},"language":[{"iso":"eng"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.","mla":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.","short":"H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.","ista":"Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.","ieee":"H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.","apa":"Edelsbrunner, H., & Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM. https://doi.org/10.1137/1.9781611973402.11","ama":"Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11"},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","page":"152 - 160","quality_controlled":"1","day":"01","month":"01","scopus_import":1},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We revisit the classical problem of converting an imperfect source of randomness into a usable cryptographic key. Assume that we have some cryptographic application P that expects a uniformly random m-bit key R and ensures that the best attack (in some complexity class) against P(R) has success probability at most δ. Our goal is to design a key-derivation function (KDF) h that converts any random source X of min-entropy k into a sufficiently "good" key h(X), guaranteeing that P(h(X)) has comparable security δ′ which is 'close' to δ. Seeded randomness extractors provide a generic way to solve this problem for all applications P, with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m + 2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k (called the "RT-bound") is also known to be tight in general. Unfortunately, in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This motivates the study KDFs with less entropy waste by placing some restrictions on the source X or the application P. In this work we obtain the following new positive and negative results in this regard: - Efficient samplability of the source X does not help beat the RT-bound for general applications. This resolves the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative, and also shows that the existence of computationally-secure extractors beating the RT-bound implies the existence of one-way functions. - We continue in the line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic KDFs which beat the RT-bound for large but restricted classes of applications. Specifically, we design efficient KDFs that work for all unpredictability applications P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)), or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds of [BDK+11] hold for a larger class of so-called "square- friendly" applications (which includes all unpredictability, but also some important indistinguishability, applications). Unfortunately, we show that these weaker bounds are tight for the larger class of applications. - We abstract out a clean, information-theoretic notion of (k,δ,δ′)- unpredictability extractors, which guarantee "induced" security δ′ for any δ-secure unpredictability application P, and characterize the parameters achievable for such unpredictability extractors. Of independent interest, we also relate this notion to the previously-known notion of (min-entropy) condensers, and improve the state-of-the-art parameters for such condensers."}],"status":"public","title":"Key derivation without entropy waste","ddc":["000","004"],"intvolume":" 8441","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2185","oa_version":"Submitted Version","file":[{"creator":"system","file_size":505389,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-680-v1+1_708.pdf","checksum":"da1aa01221086083b23c92e547b48ff4","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:08:43Z","file_id":"4705","relation":"main_file"}],"pubrep_id":"680","scopus_import":1,"day":"01","has_accepted_license":"1","page":"93 - 110","citation":{"chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110. Springer, 2014. https://doi.org/10.1007/978-3-642-55220-5_6.","mla":"Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.","short":"Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.","ista":"Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441, 93–110.","apa":"Dodis, Y., Pietrzak, K. Z., & Wichs, D. (2014). Key derivation without entropy waste. In P. Nguyen & E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-642-55220-5_6","ieee":"Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.","ama":"Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:10.1007/978-3-642-55220-5_6"},"date_published":"2014-04-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:31Z","publist_id":"4795","publication_status":"published","department":[{"_id":"KrPi"}],"editor":[{"full_name":"Nguyen, Phong","last_name":"Nguyen","first_name":"Phong"},{"last_name":"Oswald","first_name":"Elisabeth","full_name":"Oswald, Elisabeth"}],"publisher":"Springer","year":"2014","date_created":"2018-12-11T11:56:12Z","date_updated":"2021-01-12T06:55:51Z","volume":8441,"author":[{"first_name":"Yevgeniy","last_name":"Dodis","full_name":"Dodis, Yevgeniy"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"month":"04","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2014-05-15","start_date":"2014-05-11","location":"Copenhagen, Denmark","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"doi":"10.1007/978-3-642-55220-5_6"},{"ec_funded":1,"publist_id":"4802","publication_status":"published","publisher":"Springer","department":[{"_id":"ChLa"}],"acknowledgement":"This work was funded by the French project SoLSTiCe ANR-13-BS02-01 of the ANR. ","year":"2014","date_updated":"2021-01-12T06:55:49Z","date_created":"2018-12-11T11:56:10Z","volume":97,"author":[{"full_name":"Bellet, Aurélien","first_name":"Aurélien","last_name":"Bellet"},{"full_name":"Habrard, Amaury","last_name":"Habrard","first_name":"Amaury"},{"last_name":"Morvant","first_name":"Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","full_name":"Morvant, Emilie"},{"full_name":"Sebban, Marc","first_name":"Marc","last_name":"Sebban"}],"month":"10","quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01009578/document","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s10994-014-5462-z","type":"journal_article","abstract":[{"lang":"eng","text":"Weighted majority votes allow one to combine the output of several classifiers or voters. MinCq is a recent algorithm for optimizing the weight of each voter based on the minimization of a theoretical bound over the risk of the vote with elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated good performance when combining weak classifiers, MinCq cannot make use of the useful a priori knowledge that one may have when using a mixture of weak and strong voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate such knowledge in the form of a constraint over the distribution of the weights, along with general proofs of convergence that stand in the sample compression setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers with a specific modeling of the voters' performance. P-MinCq significantly outperforms the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We show that it is also competitive with LMNN, a popular metric learning algorithm, and that combining both approaches further reduces the error."}],"issue":"1-2","title":"Learning a priori constrained weighted majority votes","status":"public","intvolume":" 97","_id":"2180","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"day":"01","page":"129 - 154","publication":"Machine Learning","citation":{"ama":"Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted majority votes. Machine Learning. 2014;97(1-2):129-154. doi:10.1007/s10994-014-5462-z","ieee":"A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained weighted majority votes,” Machine Learning, vol. 97, no. 1–2. Springer, pp. 129–154, 2014.","apa":"Bellet, A., Habrard, A., Morvant, E., & Sebban, M. (2014). Learning a priori constrained weighted majority votes. Machine Learning. Springer. https://doi.org/10.1007/s10994-014-5462-z","ista":"Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained weighted majority votes. Machine Learning. 97(1–2), 129–154.","short":"A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014) 129–154.","mla":"Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.” Machine Learning, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:10.1007/s10994-014-5462-z.","chicago":"Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning a Priori Constrained Weighted Majority Votes.” Machine Learning. Springer, 2014. https://doi.org/10.1007/s10994-014-5462-z."},"date_published":"2014-10-01T00:00:00Z"},{"date_published":"2014-05-01T00:00:00Z","citation":{"mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” Journal of the ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597629.","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629","ista":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.","ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.","apa":"Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM. https://doi.org/10.1145/2597629"},"publication":"Journal of the ACM","day":"01","scopus_import":1,"oa_version":"Preprint","_id":"2184","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 61","title":"Computing all maps into a sphere","status":"public","issue":"3","abstract":[{"text":"Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable.","lang":"eng"}],"type":"journal_article","doi":"10.1145/2597629","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1105.6257","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"05","author":[{"first_name":"Martin","last_name":"Čadek","full_name":"Čadek, Martin"},{"full_name":"Krcál, Marek","last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"last_name":"Sergeraert","first_name":"Francis","full_name":"Sergeraert, Francis"},{"first_name":"Lukáš","last_name":"Vokřínek","full_name":"Vokřínek, Lukáš"},{"full_name":"Wagner, Uli","first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568"}],"volume":61,"date_created":"2018-12-11T11:56:12Z","date_updated":"2021-01-12T06:55:50Z","acknowledgement":"The research by M. K. was supported by project GAUK 49209. The research by M. K. was also supported by project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague (project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948).","year":"2014","publisher":"ACM","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publication_status":"published","publist_id":"4797","article_number":"17 "},{"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.3209"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.89.062809","month":"06","publisher":"American Institute of Physics","department":[{"_id":"GaTk"}],"publication_status":"published","year":"2014","acknowledgement":"V.B.S. is partially supported by contract MEC (Grant No. AYA2010-22111-C03-02).\r\n","volume":89,"date_updated":"2022-08-25T14:04:45Z","date_created":"2018-12-11T11:56:11Z","author":[{"full_name":"Botella Soler, Vicente","orcid":"0000-0002-8790-1914","id":"421234E8-F248-11E8-B48F-1D18A9856A87","last_name":"Botella Soler","first_name":"Vicente"},{"first_name":"Paul","last_name":"Glendinning","full_name":"Glendinning, Paul"}],"article_number":"062809","ec_funded":1,"publist_id":"4798","citation":{"chicago":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2014. https://doi.org/10.1103/PhysRevE.89.062809.","mla":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 6, 062809, American Institute of Physics, 2014, doi:10.1103/PhysRevE.89.062809.","short":"V. Botella Soler, P. Glendinning, Physical Review E Statistical Nonlinear and Soft Matter Physics 89 (2014).","ista":"Botella Soler V, Glendinning P. 2014. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(6), 062809.","ieee":"V. Botella Soler and P. Glendinning, “Hierarchy and polysynchrony in an adaptive network ,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 6. American Institute of Physics, 2014.","apa":"Botella Soler, V., & Glendinning, P. (2014). Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.89.062809","ama":"Botella Soler V, Glendinning P. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 2014;89(6). doi:10.1103/PhysRevE.89.062809"},"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","date_published":"2014-06-16T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"16","intvolume":" 89","title":"Hierarchy and polysynchrony in an adaptive network ","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2183","oa_version":"Preprint","type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes."}]},{"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2186","intvolume":" 104","status":"public","title":"On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti","issue":"7","abstract":[{"lang":"eng","text":"We prove the existence of scattering states for the defocusing cubic Gross-Pitaevskii (GP) hierarchy in ℝ3. Moreover, we show that an exponential energy growth condition commonly used in the well-posedness theory of the GP hierarchy is, in a specific sense, necessary. In fact, we prove that without the latter, there exist initial data for the focusing cubic GP hierarchy for which instantaneous blowup occurs."}],"type":"journal_article","date_published":"2014-05-07T00:00:00Z","citation":{"mla":"Chen, Thomas, et al. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics, vol. 104, no. 7, Springer, 2014, pp. 871–91, doi:10.1007/s11005-014-0693-2.","short":"T. Chen, C. Hainzl, N. Pavlović, R. Seiringer, Letters in Mathematical Physics 104 (2014) 871–891.","chicago":"Chen, Thomas, Christian Hainzl, Nataša Pavlović, and Robert Seiringer. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-014-0693-2.","ama":"Chen T, Hainzl C, Pavlović N, Seiringer R. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. 2014;104(7):871-891. doi:10.1007/s11005-014-0693-2","ista":"Chen T, Hainzl C, Pavlović N, Seiringer R. 2014. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. 104(7), 871–891.","ieee":"T. Chen, C. Hainzl, N. Pavlović, and R. Seiringer, “On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti,” Letters in Mathematical Physics, vol. 104, no. 7. Springer, pp. 871–891, 2014.","apa":"Chen, T., Hainzl, C., Pavlović, N., & Seiringer, R. (2014). On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-014-0693-2"},"publication":"Letters in Mathematical Physics","page":"871 - 891","day":"07","scopus_import":1,"author":[{"full_name":"Chen, Thomas","first_name":"Thomas","last_name":"Chen"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"last_name":"Pavlović","first_name":"Nataša","full_name":"Pavlović, Nataša"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"volume":104,"date_updated":"2021-01-12T06:55:51Z","date_created":"2018-12-11T11:56:12Z","year":"2014","department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","publist_id":"4793","doi":"10.1007/s11005-014-0693-2","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1311.2136","open_access":"1"}],"oa":1,"project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"quality_controlled":"1","month":"05"},{"type":"journal_article","abstract":[{"lang":"eng","text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results."}],"issue":"3-4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2187","ddc":["621"],"status":"public","title":"Synthesizing robust systems","intvolume":" 51","pubrep_id":"71","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:16:44Z","date_updated":"2020-07-14T12:45:31Z","checksum":"d7f560f3d923f0f00aa10a0652f83273","relation":"main_file","file_id":"5234","file_size":169523,"content_type":"application/pdf","creator":"system","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","access_level":"open_access"}],"scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Acta Informatica","citation":{"ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. Acta Informatica. 2014;51(3-4):193-220. doi:10.1007/s00236-013-0191-5","ieee":"R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0191-5","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5."},"article_type":"original","page":"193 - 220","date_published":"2014-06-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:31Z","ec_funded":1,"publist_id":"4787","year":"2014","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Hofferek, Georg","first_name":"Georg","last_name":"Hofferek"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"first_name":"Bettina","last_name":"Könighofer","full_name":"Könighofer, Bettina"},{"first_name":"Robert","last_name":"Könighofer","full_name":"Könighofer, Robert"}],"date_created":"2018-12-11T11:56:13Z","date_updated":"2021-01-12T06:55:51Z","volume":51,"month":"06","oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"doi":"10.1007/s00236-013-0191-5","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1098/rsob.140017","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"04","date_created":"2018-12-11T11:56:13Z","date_updated":"2021-01-12T06:55:52Z","volume":4,"author":[{"first_name":"Urszula","last_name":"Kania","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","full_name":"Kania, Urszula"},{"first_name":"Matyas","last_name":"Fendrych","full_name":"Fendrych, Matyas"},{"full_name":"Friml, Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiřĺ","last_name":"Friml"}],"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Royal Society","acknowledgement":"This work was supported by a grant from the Research Foundation-Flanders (Odysseus).\r\n\r\n","year":"2014","file_date_updated":"2020-07-14T12:45:31Z","publist_id":"4786","article_number":"140017","date_published":"2014-04-16T00:00:00Z","publication":"Open Biology","citation":{"ama":"Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 2014;4(APRIL). doi:10.1098/rsob.140017","ista":"Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.","ieee":"U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities and differences to animal epithelial cells,” Open Biology, vol. 4, no. APRIL. Royal Society, 2014.","apa":"Kania, U., Fendrych, M., & Friml, J. (2014). Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. Royal Society. https://doi.org/10.1098/rsob.140017","mla":"Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” Open Biology, vol. 4, no. APRIL, 140017, Royal Society, 2014, doi:10.1098/rsob.140017.","short":"U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).","chicago":"Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” Open Biology. Royal Society, 2014. https://doi.org/10.1098/rsob.140017."},"day":"16","has_accepted_license":"1","scopus_import":1,"file":[{"access_level":"open_access","file_name":"IST-2016-441-v1+1_140017.full.pdf","content_type":"application/pdf","file_size":682570,"creator":"system","relation":"main_file","file_id":"5025","checksum":"2020627feff36cf0799167c84149fa75","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:13:40Z"}],"oa_version":"Published Version","pubrep_id":"441","ddc":["570"],"status":"public","title":"Polar delivery in plants; commonalities and differences to animal epithelial cells","intvolume":" 4","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2188","abstract":[{"lang":"eng","text":"Although plant and animal cells use a similar core mechanism to deliver proteins to the plasma membrane, their different lifestyle, body organization and specific cell structures resulted in the acquisition of regulatory mechanisms that vary in the two kingdoms. In particular, cell polarity regulators do not seem to be conserved, because genes encoding key components are absent in plant genomes. In plants, the broad knowledge on polarity derives from the study of auxin transporters, the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals, much information is provided from the study of polarity in epithelial cells that exhibit basolateral and luminal apical polarities, separated by tight junctions. In this review, we summarize the similarities and differences of the polarization mechanisms between plants and animals and survey the main genetic approaches that have been used to characterize new genes involved in polarity establishment in plants, including the frequently used forward and reverse genetics screens as well as a novel chemical genetics approach that is expected to overcome the limitation of classical genetics methods."}],"issue":"APRIL","type":"journal_article"},{"language":[{"iso":"eng"}],"conference":{"location":"Saint-Etienne, France","name":"CAP: Conférence Francophone sur l'Apprentissage Automatique (Machine Learning French Conference)"},"date_published":"2014-07-01T00:00:00Z","quality_controlled":"1","page":"49-58","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01005776/","open_access":"1"}],"citation":{"ama":"Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. In: Vol 1. Elsevier; 2014:49-58.","ieee":"E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014, vol. 1, pp. 49–58.","apa":"Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France: Elsevier.","ista":"Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference) vol. 1, 49–58.","short":"E. Morvant, in:, Elsevier, 2014, pp. 49–58.","mla":"Morvant, Emilie. Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif. Vol. 1, Elsevier, 2014, pp. 49–58.","chicago":"Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif,” 1:49–58. Elsevier, 2014."},"oa":1,"month":"07","day":"01","article_processing_charge":"No","date_created":"2018-12-11T11:56:13Z","date_updated":"2021-01-12T06:55:52Z","oa_version":"Preprint","volume":1,"author":[{"full_name":"Morvant, Emilie","last_name":"Morvant","first_name":"Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87"}],"title":"Adaptation de domaine de vote de majorité par auto-étiquetage non itératif","publication_status":"published","status":"public","publisher":"Elsevier","intvolume":" 1","department":[{"_id":"ChLa"}],"_id":"2189","year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"En apprentissage automatique, nous parlons d'adaptation de domaine lorsque les données de test (cibles) et d'apprentissage (sources) sont générées selon différentes distributions. Nous devons donc développer des algorithmes de classification capables de s'adapter à une nouvelle distribution, pour laquelle aucune information sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq. PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté'' (justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage non itératif qui se focalise dans les régions où les distributions marginales source et cible sont les plus similaires. Dans un second temps, nous étudions l'influence de notre auto-étiquetage pour en déduire une procédure de validation des hyperparamètres. Finalement, notre approche montre des résultats empiriques prometteurs.","lang":"fre"}],"publist_id":"4785","type":"conference"},{"author":[{"last_name":"Esparza","first_name":"Javier","full_name":"Esparza, Javier"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"volume":8559,"date_updated":"2021-01-12T06:55:53Z","date_created":"2018-12-11T11:56:14Z","year":"2014","acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","publist_id":"4784","ec_funded":1,"doi":"10.1007/978-3-319-08867-9_13","conference":{"name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1402.3388","open_access":"1"}],"oa":1,"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"quality_controlled":"1","month":"01","oa_version":"Submitted Version","_id":"2190","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 8559","title":"From LTL to deterministic automata: A safraless compositional approach","status":"public","abstract":[{"lang":"eng","text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2014-01-01T00:00:00Z","citation":{"ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13","ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.","apa":"Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13","ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.","short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","mla":"Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13."},"page":"192 - 208","day":"01"},{"oa_version":"Submitted Version","volume":89,"date_created":"2018-12-11T11:56:20Z","date_updated":"2021-01-12T06:55:59Z","author":[{"last_name":"Lahrz","first_name":"Martin","full_name":"Lahrz, Martin"},{"first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"},{"last_name":"Sengstock","first_name":"Klaus","full_name":"Sengstock, Klaus"},{"last_name":"Becker","first_name":"Christoph","full_name":"Becker, Christoph"},{"last_name":"Mathey","first_name":"Ludwig","full_name":"Mathey, Ludwig"}],"publisher":"American Physical Society","intvolume":" 89","status":"public","publication_status":"published","title":"Detecting quadrupole interactions in ultracold Fermi gases","_id":"2208","year":"2014","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","issue":"4","publist_id":"4764","abstract":[{"text":"We propose to detect quadrupole interactions of neutral ultracold atoms via their induced mean-field shift. We consider a Mott insulator state of spin-polarized atoms in a two-dimensional optical square lattice. The quadrupole moments of the atoms are aligned by an external magnetic field. As the alignment angle is varied, the mean-field shift shows a characteristic angular dependence, which constitutes the defining signature of the quadrupole interaction. For the 3P2 states of Yb and Sr atoms, we find a frequency shift of the order of tens of Hertz, which can be realistically detected in experiment with current technology. We compare our results to the mean-field shift of a spin-polarized quasi-two-dimensional Fermi gas in continuum. ","lang":"eng"}],"type":"journal_article","article_number":"043616","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevA.89.043616","date_published":"2014-04-23T00:00:00Z","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1402.0873","open_access":"1"}],"oa":1,"citation":{"ama":"Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. Detecting quadrupole interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular, and Optical Physics. 2014;89(4). doi:10.1103/PhysRevA.89.043616","apa":"Lahrz, M., Lemeshko, M., Sengstock, K., Becker, C., & Mathey, L. (2014). Detecting quadrupole interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.89.043616","ieee":"M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, and L. Mathey, “Detecting quadrupole interactions in ultracold Fermi gases,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 89, no. 4. American Physical Society, 2014.","ista":"Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. 2014. Detecting quadrupole interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular, and Optical Physics. 89(4), 043616.","short":"M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, L. Mathey, Physical Review A - Atomic, Molecular, and Optical Physics 89 (2014).","mla":"Lahrz, Martin, et al. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 89, no. 4, 043616, American Physical Society, 2014, doi:10.1103/PhysRevA.89.043616.","chicago":"Lahrz, Martin, Mikhail Lemeshko, Klaus Sengstock, Christoph Becker, and Ludwig Mathey. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2014. https://doi.org/10.1103/PhysRevA.89.043616."},"publication":"Physical Review A - Atomic, Molecular, and Optical Physics","day":"23","month":"04"},{"author":[{"last_name":"Stoler Barak","first_name":"Liat","full_name":"Stoler Barak, Liat"},{"first_name":"Christine","last_name":"Moussion","id":"3356F664-F248-11E8-B48F-1D18A9856A87","full_name":"Moussion, Christine"},{"full_name":"Shezen, Elias","first_name":"Elias","last_name":"Shezen"},{"first_name":"Miki","last_name":"Hatzav","full_name":"Hatzav, Miki"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"first_name":"Ronen","last_name":"Alon","full_name":"Alon, Ronen"}],"volume":9,"date_updated":"2021-01-12T06:56:03Z","date_created":"2018-12-11T11:56:22Z","acknowledgement":"Michael Sixt's research is supported by the European Research Council (ERC Starting grant).","year":"2014","department":[{"_id":"MiSi"}],"publisher":"Public Library of Science","publication_status":"published","publist_id":"4756","ec_funded":1,"file_date_updated":"2020-07-14T12:45:33Z","article_number":"e85699","doi":"10.1371/journal.pone.0085699","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"Stromal Cell-immune Cell Interactions in Health and Disease","call_identifier":"FP7","_id":"25A76F58-B435-11E9-9278-68D0E5697425","grant_number":"289720"}],"quality_controlled":"1","month":"01","pubrep_id":"433","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":12634775,"creator":"system","file_name":"IST-2016-433-v1+1_journal.pone.0085699.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:33Z","date_created":"2018-12-12T10:07:48Z","checksum":"84a8033bda2e07e39405f5acc85f4eca","relation":"main_file","file_id":"4646"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2214","intvolume":" 9","ddc":["570"],"status":"public","title":"Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects","issue":"1","abstract":[{"text":"A hallmark of immune cell trafficking is directional guidance via gradients of soluble or surface bound chemokines. Vascular endothelial cells produce, transport and deposit either their own chemokines or chemokines produced by the underlying stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold for these chemokine pools, but it is unclear how steep chemokine gradients are sustained between the lumenal and ablumenal aspects of blood vessels. Addressing this question by semi-quantitative immunostaining of HS moieties around blood vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal lamina of resting and inflamed post capillary skin venules, as well as in high endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx probe further suggested that their lumenal glycocalyx contains much lower HS density than their basolateral extracellular matrix (ECM). This polarized HS pattern was observed also in isolated resting and inflamed microvascular dermal cells. Notably, progressive skin inflammation resulted in massive ECM deposition and in further HS enrichment around skin post capillary venules and their associated pericytes. Inflammation-dependent HS enrichment was not compromised in mice deficient in the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature patterns steep gradients of HS scaffolds between their lumenal and basolateral endothelial aspects, and that inflammatory processes can further enrich the HS content nearby inflamed vessels. We propose that chemokine gradients between the lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold gradients.","lang":"eng"}],"type":"journal_article","date_published":"2014-01-22T00:00:00Z","citation":{"ama":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085699","apa":"Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., & Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085699","ieee":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon, “Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.","ista":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. 9(1), e85699.","short":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS One 9 (2014).","mla":"Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” PLoS One, vol. 9, no. 1, e85699, Public Library of Science, 2014, doi:10.1371/journal.pone.0085699.","chicago":"Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085699."},"publication":"PLoS One","has_accepted_license":"1","day":"22","scopus_import":1},{"doi":"10.1038/nrm3805","date_published":"2014-05-14T00:00:00Z","language":[{"iso":"eng"}],"publication":"Nature Reviews Molecular Cell Biology","citation":{"chicago":"Renkawitz, Jörg, Claudio Lademann, and Stefan Jentsch. “Mechanisms and Principles of Homology Search during Recombination.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2014. https://doi.org/10.1038/nrm3805.","short":"J. Renkawitz, C. Lademann, S. Jentsch, Nature Reviews Molecular Cell Biology 15 (2014) 369–383.","mla":"Renkawitz, Jörg, et al. “Mechanisms and Principles of Homology Search during Recombination.” Nature Reviews Molecular Cell Biology, vol. 15, no. 6, Nature Publishing Group, 2014, pp. 369–83, doi:10.1038/nrm3805.","apa":"Renkawitz, J., Lademann, C., & Jentsch, S. (2014). Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3805","ieee":"J. Renkawitz, C. Lademann, and S. Jentsch, “Mechanisms and principles of homology search during recombination,” Nature Reviews Molecular Cell Biology, vol. 15, no. 6. Nature Publishing Group, pp. 369–383, 2014.","ista":"Renkawitz J, Lademann C, Jentsch S. 2014. Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. 15(6), 369–383.","ama":"Renkawitz J, Lademann C, Jentsch S. Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. 2014;15(6):369-383. doi:10.1038/nrm3805"},"quality_controlled":"1","page":"369 - 383","day":"14","month":"05","scopus_import":1,"author":[{"orcid":"0000-0003-2856-3369","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","last_name":"Renkawitz","first_name":"Jörg","full_name":"Renkawitz, Jörg"},{"full_name":"Lademann, Claudio","first_name":"Claudio","last_name":"Lademann"},{"full_name":"Jentsch, Stefan","first_name":"Stefan","last_name":"Jentsch"}],"date_created":"2018-12-11T11:56:22Z","date_updated":"2021-01-12T06:56:03Z","volume":15,"oa_version":"None","year":"2014","_id":"2215","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"J.R. was supported by a Boehringer Ingelheim Fonds PhD stipend.","status":"public","publication_status":"published","title":"Mechanisms and principles of homology search during recombination","publisher":"Nature Publishing Group","intvolume":" 15","department":[{"_id":"MiSi"}],"abstract":[{"lang":"eng","text":"Homologous recombination is crucial for genome stability and for genetic exchange. Although our knowledge of the principle steps in recombination and its machinery is well advanced, homology search, the critical step of exploring the genome for homologous sequences to enable recombination, has remained mostly enigmatic. However, recent methodological advances have provided considerable new insights into this fundamental step in recombination that can be integrated into a mechanistic model. These advances emphasize the importance of genomic proximity and nuclear organization for homology search and the critical role of homology search mediators in this process. They also aid our understanding of how homology search might lead to unwanted and potentially disease-promoting recombination events."}],"issue":"6","publist_id":"4755","type":"journal_article"},{"license":"https://creativecommons.org/licenses/by-nc/4.0/","file_date_updated":"2020-07-14T12:45:34Z","ec_funded":1,"publist_id":"4741","publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"JiFr"}],"year":"2014","date_updated":"2021-01-12T06:56:07Z","date_created":"2018-12-11T11:56:25Z","volume":55,"author":[{"full_name":"Tanaka, Hirokazu","last_name":"Tanaka","first_name":"Hirokazu"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"last_name":"Kitakura","first_name":"Saeko","full_name":"Kitakura, Saeko"},{"last_name":"Feraru","first_name":"Mugurel","full_name":"Feraru, Mugurel"},{"full_name":"Sasabe, Michiko","first_name":"Michiko","last_name":"Sasabe"},{"full_name":"Ishikawa, Tomomi","first_name":"Tomomi","last_name":"Ishikawa"},{"full_name":"Kleine Vehn, Jürgen","last_name":"Kleine Vehn","first_name":"Jürgen"},{"last_name":"Kakimoto","first_name":"Tatsuo","full_name":"Kakimoto, Tatsuo"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí"}],"month":"04","publication_identifier":{"issn":["00320781"]},"quality_controlled":"1","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7"},{"_id":"256BDAB0-B435-11E9-9278-68D0E5697425","name":"Innovationsförderung in der Grenzregion Österreich – Tschechische Republik durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/431","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1093/pcp/pct196","type":"journal_article","abstract":[{"lang":"eng","text":"Correct positioning of membrane proteins is an essential process in eukaryotic organisms. The plant hormone auxin is distributed through intercellular transport and triggers various cellular responses. Auxin transporters of the PIN-FORMED (PIN) family localize asymmetrically at the plasma membrane (PM) and mediate the directional transport of auxin between cells. A fungal toxin, brefeldin A (BFA), inhibits a subset of guanine nucleotide exchange factors for ADP-ribosylation factor small GTPases (ARF GEFs) including GNOM, which plays a major role in localization of PIN1 predominantly to the basal side of the PM. The Arabidopsis genome encodes 19 ARF-related putative GTPases. However, ARF components involved in PIN1 localization have been genetically poorly defined. Using a fluorescence imaging-based forward genetic approach, we identified an Arabidopsis mutant, bfa-visualized exocytic trafficking defective1 (bex1), in which PM localization of PIN1-green fluorescent protein (GFP) as well as development is hypersensitive to BFA. We found that in bex1 a member of the ARF1 gene family, ARF1A1C, was mutated. ARF1A1C localizes to the trans-Golgi network/early endosome and Golgi apparatus, acts synergistically to BEN1/MIN7 ARF GEF and is important for PIN recycling to the PM. Consistent with the developmental importance of PIN proteins, functional interference with ARF1 resulted in an impaired auxin response gradient and various developmental defects including embryonic patterning defects and growth arrest. Our results show that ARF1A1C is essential for recycling of PIN auxin transporters and for various auxin-dependent developmental processes."}],"issue":"4","title":"BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis","status":"public","ddc":["570"],"intvolume":" 55","_id":"2223","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"date_created":"2018-12-12T10:14:25Z","date_updated":"2020-07-14T12:45:34Z","checksum":"b781a76b32ac35a520256453c3ba9433","relation":"main_file","file_id":"5076","content_type":"application/pdf","file_size":2028111,"creator":"system","file_name":"IST-2016-431-v1+1_Plant_Cell_Physiol-2014-Tanaka-737-49.pdf","access_level":"open_access"}],"pubrep_id":"431","scopus_import":1,"day":"01","has_accepted_license":"1","page":"737 - 749","publication":"Plant and Cell Physiology","citation":{"mla":"Tanaka, Hirokazu, et al. “BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling of PIN Auxin Transporters and Auxin-Mediated Development in Arabidopsis.” Plant and Cell Physiology, vol. 55, no. 4, Oxford University Press, 2014, pp. 737–49, doi:10.1093/pcp/pct196.","short":"H. Tanaka, T. Nodzyński, S. Kitakura, M. Feraru, M. Sasabe, T. Ishikawa, J. Kleine Vehn, T. Kakimoto, J. Friml, Plant and Cell Physiology 55 (2014) 737–749.","chicago":"Tanaka, Hirokazu, Tomasz Nodzyński, Saeko Kitakura, Mugurel Feraru, Michiko Sasabe, Tomomi Ishikawa, Jürgen Kleine Vehn, Tatsuo Kakimoto, and Jiří Friml. “BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling of PIN Auxin Transporters and Auxin-Mediated Development in Arabidopsis.” Plant and Cell Physiology. Oxford University Press, 2014. https://doi.org/10.1093/pcp/pct196.","ama":"Tanaka H, Nodzyński T, Kitakura S, et al. BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. Plant and Cell Physiology. 2014;55(4):737-749. doi:10.1093/pcp/pct196","ista":"Tanaka H, Nodzyński T, Kitakura S, Feraru M, Sasabe M, Ishikawa T, Kleine Vehn J, Kakimoto T, Friml J. 2014. BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. Plant and Cell Physiology. 55(4), 737–749.","ieee":"H. Tanaka et al., “BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis,” Plant and Cell Physiology, vol. 55, no. 4. Oxford University Press, pp. 737–749, 2014.","apa":"Tanaka, H., Nodzyński, T., Kitakura, S., Feraru, M., Sasabe, M., Ishikawa, T., … Friml, J. (2014). BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. Plant and Cell Physiology. Oxford University Press. https://doi.org/10.1093/pcp/pct196"},"date_published":"2014-04-01T00:00:00Z"},{"year":"2014","department":[{"_id":"LaEr"}],"publisher":"Institute of Mathematical Statistics","publication_status":"published","author":[{"last_name":"Bloemendal","first_name":"Alex","full_name":"Bloemendal, Alex"},{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Knowles, Antti","last_name":"Knowles","first_name":"Antti"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"},{"full_name":"Yin, Jun","last_name":"Yin","first_name":"Jun"}],"volume":19,"date_created":"2018-12-11T11:56:25Z","date_updated":"2021-01-12T06:56:07Z","article_number":"33","ec_funded":1,"publist_id":"4739","file_date_updated":"2020-07-14T12:45:34Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.1214/EJP.v19-3054","language":[{"iso":"eng"}],"publication_identifier":{"issn":["10836489"]},"month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2225","intvolume":" 19","ddc":["510"],"title":"Isotropic local laws for sample covariance and generalized Wigner matrices","status":"public","pubrep_id":"427","oa_version":"Published Version","file":[{"date_created":"2018-12-12T10:14:06Z","date_updated":"2020-07-14T12:45:34Z","checksum":"7eb297ff367a2ee73b21b6dd1e1948e4","relation":"main_file","file_id":"5055","file_size":810150,"content_type":"application/pdf","creator":"system","file_name":"IST-2016-427-v1+1_3054-16624-4-PB.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We consider sample covariance matrices of the form X∗X, where X is an M×N matrix with independent random entries. We prove the isotropic local Marchenko-Pastur law, i.e. we prove that the resolvent (X∗X−z)−1 converges to a multiple of the identity in the sense of quadratic forms. More precisely, we establish sharp high-probability bounds on the quantity ⟨v,(X∗X−z)−1w⟩−⟨v,w⟩m(z), where m is the Stieltjes transform of the Marchenko-Pastur law and v,w∈CN. We require the logarithms of the dimensions M and N to be comparable. Our result holds down to scales Iz≥N−1+ε and throughout the entire spectrum away from 0. We also prove analogous results for generalized Wigner matrices.\r\n"}],"citation":{"chicago":"Bloemendal, Alex, László Erdös, Antti Knowles, Horng Yau, and Jun Yin. “Isotropic Local Laws for Sample Covariance and Generalized Wigner Matrices.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2014. https://doi.org/10.1214/EJP.v19-3054.","mla":"Bloemendal, Alex, et al. “Isotropic Local Laws for Sample Covariance and Generalized Wigner Matrices.” Electronic Journal of Probability, vol. 19, 33, Institute of Mathematical Statistics, 2014, doi:10.1214/EJP.v19-3054.","short":"A. Bloemendal, L. Erdös, A. Knowles, H. Yau, J. Yin, Electronic Journal of Probability 19 (2014).","ista":"Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. 2014. Isotropic local laws for sample covariance and generalized Wigner matrices. Electronic Journal of Probability. 19, 33.","apa":"Bloemendal, A., Erdös, L., Knowles, A., Yau, H., & Yin, J. (2014). Isotropic local laws for sample covariance and generalized Wigner matrices. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/EJP.v19-3054","ieee":"A. Bloemendal, L. Erdös, A. Knowles, H. Yau, and J. Yin, “Isotropic local laws for sample covariance and generalized Wigner matrices,” Electronic Journal of Probability, vol. 19. Institute of Mathematical Statistics, 2014.","ama":"Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. Isotropic local laws for sample covariance and generalized Wigner matrices. Electronic Journal of Probability. 2014;19. doi:10.1214/EJP.v19-3054"},"publication":"Electronic Journal of Probability","date_published":"2014-03-15T00:00:00Z","has_accepted_license":"1","day":"15"},{"issue":"4","abstract":[{"lang":"eng","text":"Leaf venation develops complex patterns in angiosperms, but the mechanism underlying this process is largely unknown. To elucidate the molecular mechanisms governing vein pattern formation, we previously isolated vascular network defective (van) mutants that displayed venation discontinuities. Here, we report the phenotypic analysis of van4 mutants, and we identify and characterize the VAN4 gene. Detailed phenotypic analysis shows that van4 mutants are defective in procambium cell differentiation and subsequent vascular cell differentiation. Reduced shoot and root cell growth is observed in van4 mutants, suggesting that VAN4 function is important for cell growth and the establishment of venation continuity. Consistent with these phenotypes, the VAN4 gene is strongly expressed in vascular and meristematic cells. VAN4 encodes a putative TRS120, which is a known guanine nucleotide exchange factor (GEF) for Rab GTPase involved in regulating vesicle transport, and a known tethering factor that determines the specificity of membrane fusion. VAN4 protein localizes at the trans-Golgi network/early endosome (TGN/EE). Aberrant recycling of the auxin efflux carrier PIN proteins is observed in van4 mutants. These results suggest that VAN4-mediated exocytosis at the TGN plays important roles in plant vascular development and cell growth in shoot and root. Our identification of VAN4 as a putative TRS120 shows that Rab GTPases are crucial (in addition to ARF GTPases) for continuous vascular development, and provides further evidence for the importance of vesicle transport in leaf vascular formation."}],"type":"journal_article","oa_version":"None","intvolume":" 55","title":"VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis","status":"public","_id":"2222","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2014-04-01T00:00:00Z","page":"750 - 763","citation":{"chicago":"Naramoto, Satoshi, Tomasz Nodzyński, Tomoko Dainobu, Hirotomo Takatsuka, Teruyo Okada, Jiří Friml, and Hiroo Fukuda. “VAN4 Encodes a Putative TRS120 That Is Required for Normal Cell Growth and Vein Development in Arabidopsis.” Plant and Cell Physiology. Oxford University Press, 2014. https://doi.org/10.1093/pcp/pcu012.","mla":"Naramoto, Satoshi, et al. “VAN4 Encodes a Putative TRS120 That Is Required for Normal Cell Growth and Vein Development in Arabidopsis.” Plant and Cell Physiology, vol. 55, no. 4, Oxford University Press, 2014, pp. 750–63, doi:10.1093/pcp/pcu012.","short":"S. Naramoto, T. Nodzyński, T. Dainobu, H. Takatsuka, T. Okada, J. Friml, H. Fukuda, Plant and Cell Physiology 55 (2014) 750–763.","ista":"Naramoto S, Nodzyński T, Dainobu T, Takatsuka H, Okada T, Friml J, Fukuda H. 2014. VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. Plant and Cell Physiology. 55(4), 750–763.","ieee":"S. Naramoto et al., “VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis,” Plant and Cell Physiology, vol. 55, no. 4. Oxford University Press, pp. 750–763, 2014.","apa":"Naramoto, S., Nodzyński, T., Dainobu, T., Takatsuka, H., Okada, T., Friml, J., & Fukuda, H. (2014). VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. Plant and Cell Physiology. Oxford University Press. https://doi.org/10.1093/pcp/pcu012","ama":"Naramoto S, Nodzyński T, Dainobu T, et al. VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. Plant and Cell Physiology. 2014;55(4):750-763. doi:10.1093/pcp/pcu012"},"publication":"Plant and Cell Physiology","ec_funded":1,"publist_id":"4742","volume":55,"date_created":"2018-12-11T11:56:24Z","date_updated":"2021-01-12T06:56:06Z","author":[{"first_name":"Satoshi","last_name":"Naramoto","full_name":"Naramoto, Satoshi"},{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"last_name":"Dainobu","first_name":"Tomoko","full_name":"Dainobu, Tomoko"},{"full_name":"Takatsuka, Hirotomo","first_name":"Hirotomo","last_name":"Takatsuka"},{"last_name":"Okada","first_name":"Teruyo","full_name":"Okada, Teruyo"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"},{"last_name":"Fukuda","first_name":"Hiroo","full_name":"Fukuda, Hiroo"}],"publisher":"Oxford University Press","department":[{"_id":"JiFr"}],"publication_status":"published","year":"2014","publication_identifier":{"issn":["00320781"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1093/pcp/pcu012","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"quality_controlled":"1"},{"issue":"2","publist_id":"4740","abstract":[{"lang":"eng","text":"This work investigates the transition between different traveling helical waves (spirals, SPIs) in the setup of differentially independent rotating cylinders. We use direct numerical simulations to consider an infinite long and periodic Taylor-Couette apparatus with fixed axial periodicity length. We find so-called mixed-cross-spirals (MCSs), that can be seen as nonlinear superpositions of SPIs, to establish stable footbridges connecting SPI states. While bridging the bifurcation branches of SPIs, the corresponding contributions within the MCS vary continuously with the control parameters. Here discussed MCSs presenting footbridge solutions start and end in different SPI branches. Therefore they differ significantly from the already known MCSs that present bypass solutions (Altmeyer and Hoffmann 2010 New J. Phys. 12 113035). The latter start and end in the same SPI branch, while they always bifurcate out of those SPI branches with the larger mode amplitude. Meanwhile, these only appear within the coexisting region of both SPIs. In contrast, the footbridge solutions can also bifurcate out of the minor SPI contribution. We also find they exist in regions where only one of the SPIs contributions exists. In addition, MCS as footbridge solution can appear either stable or unstable. The latter detected transient solutions offer similar spatio-temporal characteristics to the flow establishing stable footbridges. Such transition processes are interesting for pattern-forming systems in general because they accomplish transitions between traveling waves of different azimuthal wave numbers and have not been described in the literature yet."}],"type":"journal_article","article_number":"025503","author":[{"full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","last_name":"Altmeyer","first_name":"Sebastian"}],"volume":46,"oa_version":"None","date_updated":"2021-01-12T06:56:07Z","date_created":"2018-12-11T11:56:25Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2224","year":"2014","intvolume":" 46","department":[{"_id":"BjHo"}],"publisher":"IOP Publishing Ltd.","publication_status":"published","title":"On secondary instabilities generating footbridges between spiral vortex flow","status":"public","publication_identifier":{"issn":["01695983"]},"month":"04","day":"01","scopus_import":1,"date_published":"2014-04-01T00:00:00Z","doi":"10.1088/0169-5983/46/2/025503","language":[{"iso":"eng"}],"citation":{"chicago":"Altmeyer, Sebastian. “On Secondary Instabilities Generating Footbridges between Spiral Vortex Flow.” Fluid Dynamics Research. IOP Publishing Ltd., 2014. https://doi.org/10.1088/0169-5983/46/2/025503.","mla":"Altmeyer, Sebastian. “On Secondary Instabilities Generating Footbridges between Spiral Vortex Flow.” Fluid Dynamics Research, vol. 46, no. 2, 025503, IOP Publishing Ltd., 2014, doi:10.1088/0169-5983/46/2/025503.","short":"S. Altmeyer, Fluid Dynamics Research 46 (2014).","ista":"Altmeyer S. 2014. On secondary instabilities generating footbridges between spiral vortex flow. Fluid Dynamics Research. 46(2), 025503.","ieee":"S. Altmeyer, “On secondary instabilities generating footbridges between spiral vortex flow,” Fluid Dynamics Research, vol. 46, no. 2. IOP Publishing Ltd., 2014.","apa":"Altmeyer, S. (2014). On secondary instabilities generating footbridges between spiral vortex flow. Fluid Dynamics Research. IOP Publishing Ltd. https://doi.org/10.1088/0169-5983/46/2/025503","ama":"Altmeyer S. On secondary instabilities generating footbridges between spiral vortex flow. Fluid Dynamics Research. 2014;46(2). doi:10.1088/0169-5983/46/2/025503"},"publication":"Fluid Dynamics Research","quality_controlled":"1"},{"abstract":[{"text":"Recently, Döttling et al. (ASIACRYPT 2012) proposed the first chosen-ciphertext (IND-CCA) secure public-key encryption scheme from the learning parity with noise (LPN) assumption. In this work we give an alternative scheme which is conceptually simpler and more efficient. At the core of our construction is a trapdoor technique originally proposed for lattices by Micciancio and Peikert (EUROCRYPT 2012), which we adapt to the LPN setting. The main technical tool is a new double-trapdoor mechanism, together with a trapdoor switching lemma based on a computational variant of the leftover hash lemma.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","title":"Simple chosen-ciphertext security from low noise LPN","status":"public","intvolume":" 8383","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2219","day":"01","scopus_import":1,"date_published":"2014-03-01T00:00:00Z","page":"1 - 18","citation":{"mla":"Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.","short":"E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.","chicago":"Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext Security from Low Noise LPN,” 8383:1–18. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_1.","ama":"Kiltz E, Masny D, Pietrzak KZ. Simple chosen-ciphertext security from low noise LPN. In: Vol 8383. Springer; 2014:1-18. doi:10.1007/978-3-642-54631-0_1","ista":"Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383, 1–18.","apa":"Kiltz, E., Masny, D., & Pietrzak, K. Z. (2014). Simple chosen-ciphertext security from low noise LPN (Vol. 8383, pp. 1–18). Presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, Springer. https://doi.org/10.1007/978-3-642-54631-0_1","ieee":"E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18."},"publist_id":"4748","date_created":"2018-12-11T11:56:24Z","date_updated":"2021-01-12T06:56:05Z","volume":8383,"author":[{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"full_name":"Masny, Daniel","last_name":"Masny","first_name":"Daniel"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","year":"2014","month":"03","publication_identifier":{"isbn":["978-364254630-3"]},"language":[{"iso":"eng"}],"conference":{"name":"IACR: International Conference on Practice and Theory in Public-Key Cryptography"},"doi":"10.1007/978-3-642-54631-0_1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/401"}],"oa":1},{"publication":"Chemistry and Biology","citation":{"chicago":"Vos, Marjon de, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” Chemistry and Biology. Cell Press, 2014. https://doi.org/10.1016/j.chembiol.2014.04.004.","short":"M. de Vos, M.T. Bollenbach, Chemistry and Biology 21 (2014) 439–440.","mla":"de Vos, Marjon, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” Chemistry and Biology, vol. 21, no. 4, Cell Press, 2014, pp. 439–40, doi:10.1016/j.chembiol.2014.04.004.","ieee":"M. de Vos and M. T. Bollenbach, “Suppressive drug interactions between antifungals,” Chemistry and Biology, vol. 21, no. 4. Cell Press, pp. 439–440, 2014.","apa":"de Vos, M., & Bollenbach, M. T. (2014). Suppressive drug interactions between antifungals. Chemistry and Biology. Cell Press. https://doi.org/10.1016/j.chembiol.2014.04.004","ista":"de Vos M, Bollenbach MT. 2014. Suppressive drug interactions between antifungals. Chemistry and Biology. 21(4), 439–440.","ama":"de Vos M, Bollenbach MT. Suppressive drug interactions between antifungals. Chemistry and Biology. 2014;21(4):439-440. doi:10.1016/j.chembiol.2014.04.004"},"page":"439 - 440","date_published":"2014-04-24T00:00:00Z","scopus_import":1,"day":"24","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2220","status":"public","title":"Suppressive drug interactions between antifungals","intvolume":" 21","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"In this issue of Chemistry & Biology, Cokol and colleagues report a systematic study of drug interactions between antifungal compounds. Suppressive drug interactions occur more frequently than previously realized and come in different flavors with interesting implications.","lang":"eng"}],"issue":"4","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/24766845","open_access":"1"}],"oa":1,"external_id":{"pmid":["24766845"]},"quality_controlled":"1","doi":"10.1016/j.chembiol.2014.04.004","language":[{"iso":"eng"}],"month":"04","publication_identifier":{"issn":["10745521"]},"year":"2014","pmid":1,"publication_status":"published","publisher":"Cell Press","department":[{"_id":"ToBo"}],"author":[{"last_name":"De Vos","first_name":"Marjon","id":"3111FFAC-F248-11E8-B48F-1D18A9856A87","full_name":"De Vos, Marjon"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","first_name":"Mark Tobias","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias"}],"date_updated":"2021-01-12T06:56:06Z","date_created":"2018-12-11T11:56:24Z","volume":21,"publist_id":"4747"},{"intvolume":" 10","ddc":["000"],"status":"public","title":"Exact and approximate determinization of discounted-sum automata","_id":"2233","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4643","relation":"main_file","date_created":"2018-12-12T10:07:45Z","date_updated":"2020-07-14T12:45:34Z","checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","file_name":"IST-2015-389-v1+1_1401.3957.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":550936}],"oa_version":"Published Version","pubrep_id":"389","type":"journal_article","issue":"1","abstract":[{"text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. ","lang":"eng"}],"citation":{"ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 2014;10(1). doi:10.2168/LMCS-10(1:10)2014","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.","apa":"Boker, U., & Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-10(1:10)2014","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).","short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:10)2014.","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:10)2014."},"publication":"Logical Methods in Computer Science","date_published":"2014-02-13T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"13","publisher":"International Federation of Computational Logic","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2014","volume":10,"date_updated":"2021-01-12T06:56:11Z","date_created":"2018-12-11T11:56:28Z","author":[{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"publist_id":"4728","ec_funded":1,"file_date_updated":"2020-07-14T12:45:34Z","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.2168/LMCS-10(1:10)2014","publication_identifier":{"issn":["18605974"]},"month":"02"},{"publist_id":"4731","file_date_updated":"2020-07-14T12:45:34Z","article_number":"16","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","last_name":"Guzmán","first_name":"José","full_name":"Guzmán, José"},{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"full_name":"Schmidt Hieber, Christoph","first_name":"Christoph","last_name":"Schmidt Hieber"}],"volume":8,"date_updated":"2021-01-12T06:56:09Z","date_created":"2018-12-11T11:56:27Z","year":"2014","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"publisher":"Frontiers Research Foundation","publication_status":"published","publication_identifier":{"issn":["16625196"]},"month":"02","doi":"10.3389/fninf.2014.00016","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","issue":"FEB","abstract":[{"text":"Intracellular electrophysiological recordings provide crucial insights into elementary neuronal signals such as action potentials and synaptic currents. Analyzing and interpreting these signals is essential for a quantitative understanding of neuronal information processing, and requires both fast data visualization and ready access to complex analysis routines. To achieve this goal, we have developed Stimfit, a free software package for cellular neurophysiology with a Python scripting interface and a built-in Python shell. The program supports most standard file formats for cellular neurophysiology and other biomedical signals through the Biosig library. To quantify and interpret the activity of single neurons and communication between neurons, the program includes algorithms to characterize the kinetics of presynaptic action potentials and postsynaptic currents, estimate latencies between pre- and postsynaptic events, and detect spontaneously occurring events. We validate and benchmark these algorithms, give estimation errors, and provide sample use cases, showing that Stimfit represents an efficient, accessible and extensible way to accurately analyze and interpret neuronal signals.","lang":"eng"}],"type":"journal_article","pubrep_id":"425","file":[{"checksum":"eeca00bba7232ff7d27db83321f6ea30","date_updated":"2020-07-14T12:45:34Z","date_created":"2018-12-12T10:12:17Z","relation":"main_file","file_id":"4935","file_size":2883372,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-425-v1+1_fninf-08-00016.pdf"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2230","intvolume":" 8","title":"Stimfit: Quantifying electrophysiological data with Python","ddc":["570"],"status":"public","has_accepted_license":"1","day":"21","scopus_import":1,"date_published":"2014-02-21T00:00:00Z","citation":{"short":"J. Guzmán, A. Schlögl, C. Schmidt Hieber, Frontiers in Neuroinformatics 8 (2014).","mla":"Guzmán, José, et al. “Stimfit: Quantifying Electrophysiological Data with Python.” Frontiers in Neuroinformatics, vol. 8, no. FEB, 16, Frontiers Research Foundation, 2014, doi:10.3389/fninf.2014.00016.","chicago":"Guzmán, José, Alois Schlögl, and Christoph Schmidt Hieber. “Stimfit: Quantifying Electrophysiological Data with Python.” Frontiers in Neuroinformatics. Frontiers Research Foundation, 2014. https://doi.org/10.3389/fninf.2014.00016.","ama":"Guzmán J, Schlögl A, Schmidt Hieber C. Stimfit: Quantifying electrophysiological data with Python. Frontiers in Neuroinformatics. 2014;8(FEB). doi:10.3389/fninf.2014.00016","apa":"Guzmán, J., Schlögl, A., & Schmidt Hieber, C. (2014). Stimfit: Quantifying electrophysiological data with Python. Frontiers in Neuroinformatics. Frontiers Research Foundation. https://doi.org/10.3389/fninf.2014.00016","ieee":"J. Guzmán, A. Schlögl, and C. Schmidt Hieber, “Stimfit: Quantifying electrophysiological data with Python,” Frontiers in Neuroinformatics, vol. 8, no. FEB. Frontiers Research Foundation, 2014.","ista":"Guzmán J, Schlögl A, Schmidt Hieber C. 2014. Stimfit: Quantifying electrophysiological data with Python. Frontiers in Neuroinformatics. 8(FEB), 16."},"publication":"Frontiers in Neuroinformatics"},{"language":[{"iso":"eng"}],"doi":"10.1038/nn.3678","project":[{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548"},{"grant_number":"P24909-B24","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4286295/","open_access":"1"}],"publication_identifier":{"issn":["10976256"]},"month":"03","volume":17,"date_created":"2018-12-11T11:56:26Z","date_updated":"2021-01-12T06:56:08Z","author":[{"last_name":"Hu","first_name":"Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","full_name":"Hu, Hua"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Nature Publishing Group","department":[{"_id":"PeJo"}],"publication_status":"published","year":"2014","ec_funded":1,"publist_id":"4733","date_published":"2014-03-23T00:00:00Z","page":"686-693","citation":{"ista":"Hu H, Jonas PM. 2014. A supercritical density of Na^+ channels ensures fast signaling in GABAergic interneuron axons. Nature Neuroscience. 17(5), 686–693.","ieee":"H. Hu and P. M. Jonas, “A supercritical density of Na^+ channels ensures fast signaling in GABAergic interneuron axons,” Nature Neuroscience, vol. 17, no. 5. Nature Publishing Group, pp. 686–693, 2014.","apa":"Hu, H., & Jonas, P. M. (2014). A supercritical density of Na^+ channels ensures fast signaling in GABAergic interneuron axons. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3678","ama":"Hu H, Jonas PM. A supercritical density of Na^+ channels ensures fast signaling in GABAergic interneuron axons. Nature Neuroscience. 2014;17(5):686-693. doi:10.1038/nn.3678","chicago":"Hu, Hua, and Peter M Jonas. “A Supercritical Density of Na^+ Channels Ensures Fast Signaling in GABAergic Interneuron Axons.” Nature Neuroscience. Nature Publishing Group, 2014. https://doi.org/10.1038/nn.3678.","mla":"Hu, Hua, and Peter M. Jonas. “A Supercritical Density of Na^+ Channels Ensures Fast Signaling in GABAergic Interneuron Axons.” Nature Neuroscience, vol. 17, no. 5, Nature Publishing Group, 2014, pp. 686–93, doi:10.1038/nn.3678.","short":"H. Hu, P.M. Jonas, Nature Neuroscience 17 (2014) 686–693."},"publication":"Nature Neuroscience","day":"23","scopus_import":1,"oa_version":"Submitted Version","intvolume":" 17","title":"A supercritical density of Na^+ channels ensures fast signaling in GABAergic interneuron axons","status":"public","_id":"2228","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","issue":"5","abstract":[{"text":"Fast-spiking, parvalbumin-expressing GABAergic interneurons, a large proportion of which are basket cells (BCs), have a key role in feedforward and feedback inhibition, gamma oscillations and complex information processing. For these functions, fast propagation of action potentials (APs) from the soma to the presynaptic terminals is important. However, the functional properties of interneuron axons remain elusive. We examined interneuron axons by confocally targeted subcellular patch-clamp recording in rat hippocampal slices. APs were initiated in the proximal axon ∼20 μm from the soma and propagated to the distal axon with high reliability and speed. Subcellular mapping revealed a stepwise increase of Na^+ conductance density from the soma to the proximal axon, followed by a further gradual increase in the distal axon. Active cable modeling and experiments with partial channel block revealed that low axonal Na^+ conductance density was sufficient for reliability, but high Na^+ density was necessary for both speed of propagation and fast-spiking AP phenotype. Our results suggest that a supercritical density of Na^+ channels compensates for the morphological properties of interneuron axons (small segmental diameter, extensive branching and high bouton density), ensuring fast AP propagation and high-frequency repetitive firing.","lang":"eng"}],"type":"journal_article"},{"month":"02","publication_identifier":{"issn":["00368075"]},"oa":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617475/","open_access":"1"}],"quality_controlled":"1","project":[{"_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24","call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses"},{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548"}],"doi":"10.1126/science.1244811","language":[{"iso":"eng"}],"publist_id":"4732","ec_funded":1,"year":"2014","publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"American Association for the Advancement of Science","author":[{"first_name":"Nicholas","last_name":"Vyleta","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","full_name":"Vyleta, Nicholas"},{"full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"date_updated":"2021-01-12T06:56:09Z","date_created":"2018-12-11T11:56:27Z","volume":343,"scopus_import":1,"day":"01","publication":"Science","citation":{"ama":"Vyleta N, Jonas PM. Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal synapse. Science. 2014;343(6171):665-670. doi:10.1126/science.1244811","ista":"Vyleta N, Jonas PM. 2014. Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal synapse. Science. 343(6171), 665–670.","ieee":"N. Vyleta and P. M. Jonas, “Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal synapse,” Science, vol. 343, no. 6171. American Association for the Advancement of Science, pp. 665–670, 2014.","apa":"Vyleta, N., & Jonas, P. M. (2014). Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal synapse. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1244811","mla":"Vyleta, Nicholas, and Peter M. Jonas. “Loose Coupling between Ca^2+ Channels and Release Sensors at a Plastic Hippocampal Synapse.” Science, vol. 343, no. 6171, American Association for the Advancement of Science, 2014, pp. 665–70, doi:10.1126/science.1244811.","short":"N. Vyleta, P.M. Jonas, Science 343 (2014) 665–670.","chicago":"Vyleta, Nicholas, and Peter M Jonas. “Loose Coupling between Ca^2+ Channels and Release Sensors at a Plastic Hippocampal Synapse.” Science. American Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1244811."},"page":"665 - 670","date_published":"2014-02-01T00:00:00Z","type":"journal_article","abstract":[{"text":"The distance between Ca^2+ channels and release sensors determines the speed and efficacy of synaptic transmission. Tight "nanodomain" channel-sensor coupling initiates transmitter release at synapses in the mature brain, whereas loose "microdomain" coupling appears restricted to early developmental stages. To probe the coupling configuration at a plastic synapse in the mature central nervous system, we performed paired recordings between mossy fiber terminals and CA3 pyramidal neurons in rat hippocampus. Millimolar concentrations of both the fast Ca^2+ chelator BAPTA [1,2-bis(2-aminophenoxy)ethane- N,N, N′,N′-tetraacetic acid] and the slow chelator EGTA efficiently suppressed transmitter release, indicating loose coupling between Ca^2+ channels and release sensors. Loose coupling enabled the control of initial release probability by fast endogenous Ca^2+ buffers and the generation of facilitation by buffer saturation. Thus, loose coupling provides the molecular framework for presynaptic plasticity.","lang":"eng"}],"issue":"6171","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2229","title":"Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal synapse","status":"public","intvolume":" 343","oa_version":"Submitted Version"},{"date_published":"2014-02-01T00:00:00Z","article_type":"original","publication":"Journal of Statistical Mechanics Theory and Experiment","citation":{"short":"B. Song, B. Hof, Journal of Statistical Mechanics Theory and Experiment 2014 (2014).","mla":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” Journal of Statistical Mechanics Theory and Experiment, vol. 2014, no. 2, P02001, IOP Publishing, 2014, doi:10.1088/1742-5468/2014/02/P02001.","chicago":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” Journal of Statistical Mechanics Theory and Experiment. IOP Publishing, 2014. https://doi.org/10.1088/1742-5468/2014/02/P02001.","ama":"Song B, Hof B. Deterministic and stochastic aspects of the transition to turbulence. Journal of Statistical Mechanics Theory and Experiment. 2014;2014(2). doi:10.1088/1742-5468/2014/02/P02001","ieee":"B. Song and B. Hof, “Deterministic and stochastic aspects of the transition to turbulence,” Journal of Statistical Mechanics Theory and Experiment, vol. 2014, no. 2. IOP Publishing, 2014.","apa":"Song, B., & Hof, B. (2014). Deterministic and stochastic aspects of the transition to turbulence. Journal of Statistical Mechanics Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/2014/02/P02001","ista":"Song B, Hof B. 2014. Deterministic and stochastic aspects of the transition to turbulence. Journal of Statistical Mechanics Theory and Experiment. 2014(2), P02001."},"day":"01","article_processing_charge":"No","oa_version":"Submitted Version","status":"public","title":"Deterministic and stochastic aspects of the transition to turbulence","intvolume":" 2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2232","abstract":[{"lang":"eng","text":"The purpose of this contribution is to summarize and discuss recent advances regarding the onset of turbulence in shear flows. The absence of a clear-cut instability mechanism, the spatio-temporal intermittent character and extremely long lived transients are some of the major difficulties encountered in these flows and have hindered progress towards understanding the transition process. We will show for the case of pipe flow that concepts from nonlinear dynamics and statistical physics can help to explain the onset of turbulence. In particular, the turbulent structures (puffs) observed close to onset are spatially localized chaotic transients and their lifetimes increase super-exponentially with Reynolds number. At the same time fluctuations of individual turbulent puffs can (although very rarely) lead to the nucleation of new puffs. The competition between these two stochastic processes gives rise to a non-equilibrium phase transition where turbulence changes from a super-transient to a sustained state."}],"issue":"2","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1088/1742-5468/2014/02/P02001","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1403.4516","open_access":"1"}],"external_id":{"arxiv":["1403.4516"]},"oa":1,"month":"02","publication_identifier":{"issn":["17425468"]},"date_updated":"2022-06-10T10:13:15Z","date_created":"2018-12-11T11:56:28Z","volume":2014,"author":[{"last_name":"Song","first_name":"Baofang","id":"a79e57f5-e8a5-11ec-9dc9-83fb8c81cf72","full_name":"Song, Baofang"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn"}],"publication_status":"published","publisher":"IOP Publishing","department":[{"_id":"BjHo"}],"year":"2014","publist_id":"4729","article_number":"P02001"},{"scopus_import":1,"day":"04","page":"1194 - 1204","publication":"Biophysical Journal","citation":{"ama":"Rieckh G, Tkačik G. Noise and information transmission in promoters with multiple internal states. Biophysical Journal. 2014;106(5):1194-1204. doi:10.1016/j.bpj.2014.01.014","apa":"Rieckh, G., & Tkačik, G. (2014). Noise and information transmission in promoters with multiple internal states. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2014.01.014","ieee":"G. Rieckh and G. Tkačik, “Noise and information transmission in promoters with multiple internal states,” Biophysical Journal, vol. 106, no. 5. Biophysical Society, pp. 1194–1204, 2014.","ista":"Rieckh G, Tkačik G. 2014. Noise and information transmission in promoters with multiple internal states. Biophysical Journal. 106(5), 1194–1204.","short":"G. Rieckh, G. Tkačik, Biophysical Journal 106 (2014) 1194–1204.","mla":"Rieckh, Georg, and Gašper Tkačik. “Noise and Information Transmission in Promoters with Multiple Internal States.” Biophysical Journal, vol. 106, no. 5, Biophysical Society, 2014, pp. 1194–204, doi:10.1016/j.bpj.2014.01.014.","chicago":"Rieckh, Georg, and Gašper Tkačik. “Noise and Information Transmission in Promoters with Multiple Internal States.” Biophysical Journal. Biophysical Society, 2014. https://doi.org/10.1016/j.bpj.2014.01.014."},"date_published":"2014-03-04T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Based on the measurements of noise in gene expression performed during the past decade, it has become customary to think of gene regulation in terms of a two-state model, where the promoter of a gene can stochastically switch between an ON and an OFF state. As experiments are becoming increasingly precise and the deviations from the two-state model start to be observable, we ask about the experimental signatures of complex multistate promoters, as well as the functional consequences of this additional complexity. In detail, we i), extend the calculations for noise in gene expression to promoters described by state transition diagrams with multiple states, ii), systematically compute the experimentally accessible noise characteristics for these complex promoters, and iii), use information theory to evaluate the channel capacities of complex promoter architectures and compare them with the baseline provided by the two-state model. We find that adding internal states to the promoter generically decreases channel capacity, except in certain cases, three of which (cooperativity, dual-role regulation, promoter cycling) we analyze in detail."}],"issue":"5","title":"Noise and information transmission in promoters with multiple internal states","status":"public","intvolume":" 106","_id":"2231","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","month":"03","publication_identifier":{"issn":["00063495"]},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4026790/"}],"oa":1,"external_id":{"pmid":["24606943"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.bpj.2014.01.014","publist_id":"4730","publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Biophysical Society","year":"2014","pmid":1,"date_updated":"2021-01-12T06:56:10Z","date_created":"2018-12-11T11:56:28Z","volume":106,"author":[{"full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","last_name":"Rieckh","first_name":"Georg"},{"full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}]},{"oa_version":"Submitted Version","status":"public","title":"Transient growth of Ekman-Couette flow","intvolume":" 89","_id":"2226","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Coriolis force effects on shear flows are important in geophysical and astrophysical contexts. We report a study on the linear stability and the transient energy growth of the plane Couette flow with system rotation perpendicular to the shear direction. External rotation causes linear instability. At small rotation rates, the onset of linear instability scales inversely with the rotation rate and the optimal transient growth in the linearly stable region is slightly enhanced ∼Re2. The corresponding optimal initial perturbations are characterized by roll structures inclined in the streamwise direction and are twisted under external rotation. At large rotation rates, the transient growth is significantly inhibited and hence linear stability analysis is a reliable indicator for instability.","lang":"eng"}],"issue":"1","type":"journal_article","date_published":"2014-01-06T00:00:00Z","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","citation":{"ama":"Shi L, Hof B, Tilgner A. Transient growth of Ekman-Couette flow. Physical Review E Statistical Nonlinear and Soft Matter Physics. 2014;89(1). doi:10.1103/PhysRevE.89.013001","apa":"Shi, L., Hof, B., & Tilgner, A. (2014). Transient growth of Ekman-Couette flow. Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.89.013001","ieee":"L. Shi, B. Hof, and A. Tilgner, “Transient growth of Ekman-Couette flow,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 1. American Institute of Physics, 2014.","ista":"Shi L, Hof B, Tilgner A. 2014. Transient growth of Ekman-Couette flow. Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(1), 013001.","short":"L. Shi, B. Hof, A. Tilgner, Physical Review E Statistical Nonlinear and Soft Matter Physics 89 (2014).","mla":"Shi, Liang, et al. “Transient Growth of Ekman-Couette Flow.” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 1, 013001, American Institute of Physics, 2014, doi:10.1103/PhysRevE.89.013001.","chicago":"Shi, Liang, Björn Hof, and Andreas Tilgner. “Transient Growth of Ekman-Couette Flow.” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2014. https://doi.org/10.1103/PhysRevE.89.013001."},"day":"06","scopus_import":1,"date_created":"2018-12-11T11:56:26Z","date_updated":"2021-01-12T06:56:08Z","volume":89,"author":[{"full_name":"Shi, Liang","last_name":"Shi","first_name":"Liang"},{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"},{"last_name":"Tilgner","first_name":"Andreas","full_name":"Tilgner, Andreas"}],"publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"American Institute of Physics","year":"2014","publist_id":"4737","article_number":"013001","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.89.013001","quality_controlled":"1","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.5095"}],"month":"01","publication_identifier":{"issn":["15393755"]}},{"page":"1 - 10","quality_controlled":"1","citation":{"mla":"Cires Rodriguez, Eduardo, et al. “Allopolyploid Origin of the Balkan Endemic Ranunculus Wettsteinii (Ranunculaceae) Inferred from Nuclear and Plastid DNA Sequences.” Organisms Diversity and Evolution, vol. 14, no. 1, Springer, 2014, pp. 1–10, doi:10.1007/s13127-013-0150-6.","short":"E. Cires Rodriguez, M. Baltisberger, C. Cuesta, P. Vargas, J. Prieto, Organisms Diversity and Evolution 14 (2014) 1–10.","chicago":"Cires Rodriguez, Eduardo, Matthias Baltisberger, Candela Cuesta, Pablo Vargas, and José Prieto. “Allopolyploid Origin of the Balkan Endemic Ranunculus Wettsteinii (Ranunculaceae) Inferred from Nuclear and Plastid DNA Sequences.” Organisms Diversity and Evolution. Springer, 2014. https://doi.org/10.1007/s13127-013-0150-6.","ama":"Cires Rodriguez E, Baltisberger M, Cuesta C, Vargas P, Prieto J. Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences. Organisms Diversity and Evolution. 2014;14(1):1-10. doi:10.1007/s13127-013-0150-6","ista":"Cires Rodriguez E, Baltisberger M, Cuesta C, Vargas P, Prieto J. 2014. Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences. Organisms Diversity and Evolution. 14(1), 1–10.","ieee":"E. Cires Rodriguez, M. Baltisberger, C. Cuesta, P. Vargas, and J. Prieto, “Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences,” Organisms Diversity and Evolution, vol. 14, no. 1. Springer, pp. 1–10, 2014.","apa":"Cires Rodriguez, E., Baltisberger, M., Cuesta, C., Vargas, P., & Prieto, J. (2014). Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences. Organisms Diversity and Evolution. Springer. https://doi.org/10.1007/s13127-013-0150-6"},"publication":"Organisms Diversity and Evolution","language":[{"iso":"eng"}],"doi":"10.1007/s13127-013-0150-6","date_published":"2014-03-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","publication_identifier":{"issn":["14396092"]},"day":"01","month":"03","intvolume":" 14","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"publisher":"Springer","publication_status":"published","title":"Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences","status":"public","_id":"2227","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2014","volume":14,"oa_version":"None","date_created":"2018-12-11T11:56:26Z","date_updated":"2022-08-25T14:42:46Z","author":[{"id":"2AD56A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Cires Rodriguez","first_name":"Eduardo","full_name":"Cires Rodriguez, Eduardo"},{"full_name":"Baltisberger, Matthias","last_name":"Baltisberger","first_name":"Matthias"},{"first_name":"Candela","last_name":"Cuesta","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1923-2410","full_name":"Cuesta, Candela"},{"full_name":"Vargas, Pablo","last_name":"Vargas","first_name":"Pablo"},{"full_name":"Prieto, José","last_name":"Prieto","first_name":"José"}],"type":"journal_article","publist_id":"4734","issue":"1","abstract":[{"lang":"eng","text":"The Balkan Peninsula, characterized by high rates of endemism, is recognised as one of the most diverse and species-rich areas of Europe. However, little is known about the origin of Balkan endemics. The present study addresses the phylogenetic position of the Balkan endemic Ranunculus wettsteinii, as well as its taxonomic status and relationship with the widespread R. parnassiifolius, based on nuclear DNA (internal transcribed spacer, ITS) and plastid regions (rpl32-trnL, rps16-trnQ, trnK-matK and ycf6-psbM). Maximum parsimony and Bayesian inference analyses revealed a well-supported clade formed by accessions of R. wettsteinii. Furthermore, our phylogenetic and network analyses supported previous hypotheses of a likely allopolyploid origin for R. wettsteinii between R. montenegrinus and R. parnassiifolius, with the latter as the maternal parent."}]},{"month":"02","publication_identifier":{"issn":["18605974"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/428","open_access":"1"}],"quality_controlled":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.2168/LMCS-10(1:13)2014","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:34Z","ec_funded":1,"publist_id":"4727","year":"2014","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"full_name":"Brožek, Václav","first_name":"Václav","last_name":"Brožek"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"}],"date_updated":"2021-01-12T06:56:11Z","date_created":"2018-12-11T11:56:29Z","volume":10,"scopus_import":1,"day":"14","has_accepted_license":"1","publication":"Logical Methods in Computer Science","citation":{"chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:13)2014.","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:13)2014.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-10(1:13)2014","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 2014;10(1). doi:10.2168/LMCS-10(1:13)2014"},"date_published":"2014-02-14T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε > 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε > 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results."}],"issue":"1","_id":"2234","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Markov decision processes with multiple long-run average objectives","status":"public","ddc":["000"],"intvolume":" 10","pubrep_id":"428","oa_version":"Published Version","file":[{"checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","date_created":"2018-12-12T10:07:57Z","date_updated":"2020-07-14T12:45:34Z","relation":"main_file","file_id":"4656","file_size":375388,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-428-v1+1_1104.3489.pdf"}]},{"day":"01","has_accepted_license":"1","citation":{"mla":"Jetchev, Dimitar, and Krzysztof Z. Pietrzak. How to Fake Auxiliary Input. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:10.1007/978-3-642-54242-8_24.","short":"D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.","chicago":"Jetchev, Dimitar, and Krzysztof Z Pietrzak. “How to Fake Auxiliary Input.” edited by Yehuda Lindell, 8349:566–90. Springer, 2014. https://doi.org/10.1007/978-3-642-54242-8_24.","ama":"Jetchev D, Pietrzak KZ. How to fake auxiliary input. In: Lindell Y, ed. Vol 8349. Springer; 2014:566-590. doi:10.1007/978-3-642-54242-8_24","ista":"Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349, 566–590.","ieee":"D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.","apa":"Jetchev, D., & Pietrzak, K. Z. (2014). How to fake auxiliary input. In Y. Lindell (Ed.) (Vol. 8349, pp. 566–590). Presented at the TCC: Theory of Cryptography Conference, San Diego, USA: Springer. https://doi.org/10.1007/978-3-642-54242-8_24"},"page":"566 - 590","date_published":"2014-02-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Consider a joint distribution (X,A) on a set. We show that for any family of distinguishers, there exists a simulator such that 1 no function in can distinguish (X,A) from (X,h(X)) with advantage ε, 2 h is only O(2 3ℓ ε -2) times less efficient than the functions in. For the most interesting settings of the parameters (in particular, the cryptographic case where X has superlogarithmic min-entropy, ε > 0 is negligible and consists of circuits of polynomial size), we can make the simulator h deterministic. As an illustrative application of our theorem, we give a new security proof for the leakage-resilient stream-cipher from Eurocrypt'09. Our proof is simpler and quantitatively much better than the original proof using the dense model theorem, giving meaningful security guarantees if instantiated with a standard blockcipher like AES. Subsequent to this work, Chung, Lui and Pass gave an interactive variant of our main theorem, and used it to investigate weak notions of Zero-Knowledge. Vadhan and Zheng give a more constructive version of our theorem using their new uniform min-max theorem.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2236","ddc":["004"],"title":"How to fake auxiliary input","status":"public","intvolume":" 8349","pubrep_id":"681","file":[{"date_updated":"2020-07-14T12:45:34Z","date_created":"2018-12-12T10:17:21Z","checksum":"42960325c29dcd8d832edadcc3ce0045","file_id":"5275","relation":"main_file","creator":"system","file_size":313528,"content_type":"application/pdf","file_name":"IST-2016-681-v1+1_869_1_.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","month":"02","publication_identifier":{"isbn":["978-364254241-1"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/681"}],"quality_controlled":"1","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"conference":{"end_date":"2014-02-26","start_date":"2014-02-24","location":"San Diego, USA","name":"TCC: Theory of Cryptography Conference"},"doi":"10.1007/978-3-642-54242-8_24","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:34Z","publist_id":"4725","ec_funded":1,"year":"2014","publication_status":"published","editor":[{"last_name":"Lindell","first_name":"Yehuda","full_name":"Lindell, Yehuda"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","author":[{"full_name":"Jetchev, Dimitar","last_name":"Jetchev","first_name":"Dimitar"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"date_created":"2018-12-11T11:56:29Z","date_updated":"2021-01-12T06:56:12Z","volume":8349},{"day":"13","month":"02","publication_identifier":{"issn":["00928674"]},"scopus_import":1,"doi":"10.1016/j.cell.2014.01.039","date_published":"2014-02-13T00:00:00Z","language":[{"iso":"eng"}],"publication":"Cell","citation":{"chicago":"Gadeyne, Astrid, Clara Sánchez Rodríguez, Steffen Vanneste, Simone Di Rubbo, Henrik Zauber, Kevin Vanneste, Jelle Van Leene, et al. “The TPLATE Adaptor Complex Drives Clathrin-Mediated Endocytosis in Plants.” Cell. Cell Press, 2014. https://doi.org/10.1016/j.cell.2014.01.039.","short":"A. Gadeyne, C. Sánchez Rodríguez, S. Vanneste, S. Di Rubbo, H. Zauber, K. Vanneste, J. Van Leene, N. De Winne, D. Eeckhout, G. Persiau, E. Van De Slijke, B. Cannoot, L. Vercruysse, J. Mayers, M. Adamowski, U. Kania, M. Ehrlich, A. Schweighofer, T. Ketelaar, S. Maere, S. Bednarek, J. Friml, K. Gevaert, E. Witters, E. Russinova, S. Persson, G. De Jaeger, D. Van Damme, Cell 156 (2014) 691–704.","mla":"Gadeyne, Astrid, et al. “The TPLATE Adaptor Complex Drives Clathrin-Mediated Endocytosis in Plants.” Cell, vol. 156, no. 4, Cell Press, 2014, pp. 691–704, doi:10.1016/j.cell.2014.01.039.","apa":"Gadeyne, A., Sánchez Rodríguez, C., Vanneste, S., Di Rubbo, S., Zauber, H., Vanneste, K., … Van Damme, D. (2014). The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. Cell. Cell Press. https://doi.org/10.1016/j.cell.2014.01.039","ieee":"A. Gadeyne et al., “The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants,” Cell, vol. 156, no. 4. Cell Press, pp. 691–704, 2014.","ista":"Gadeyne A, Sánchez Rodríguez C, Vanneste S, Di Rubbo S, Zauber H, Vanneste K, Van Leene J, De Winne N, Eeckhout D, Persiau G, Van De Slijke E, Cannoot B, Vercruysse L, Mayers J, Adamowski M, Kania U, Ehrlich M, Schweighofer A, Ketelaar T, Maere S, Bednarek S, Friml J, Gevaert K, Witters E, Russinova E, Persson S, De Jaeger G, Van Damme D. 2014. The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. Cell. 156(4), 691–704.","ama":"Gadeyne A, Sánchez Rodríguez C, Vanneste S, et al. The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. Cell. 2014;156(4):691-704. doi:10.1016/j.cell.2014.01.039"},"quality_controlled":"1","page":"691 - 704","abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis is the major mechanism for eukaryotic plasma membrane-based proteome turn-over. In plants, clathrin-mediated endocytosis is essential for physiology and development, but the identification and organization of the machinery operating this process remains largely obscure. Here, we identified an eight-core-component protein complex, the TPLATE complex, essential for plant growth via its role as major adaptor module for clathrin-mediated endocytosis. This complex consists of evolutionarily unique proteins that associate closely with core endocytic elements. The TPLATE complex is recruited as dynamic foci at the plasma membrane preceding recruitment of adaptor protein complex 2, clathrin, and dynamin-related proteins. Reduced function of different complex components severely impaired internalization of assorted endocytic cargoes, demonstrating its pivotal role in clathrin-mediated endocytosis. Taken together, the TPLATE complex is an early endocytic module representing a unique evolutionary plant adaptation of the canonical eukaryotic pathway for clathrin-mediated endocytosis."}],"publist_id":"4721","issue":"4","type":"journal_article","author":[{"full_name":"Gadeyne, Astrid","first_name":"Astrid","last_name":"Gadeyne"},{"first_name":"Clara","last_name":"Sánchez Rodríguez","full_name":"Sánchez Rodríguez, Clara"},{"first_name":"Steffen","last_name":"Vanneste","full_name":"Vanneste, Steffen"},{"full_name":"Di Rubbo, Simone","last_name":"Di Rubbo","first_name":"Simone"},{"last_name":"Zauber","first_name":"Henrik","full_name":"Zauber, Henrik"},{"full_name":"Vanneste, Kevin","last_name":"Vanneste","first_name":"Kevin"},{"full_name":"Van Leene, Jelle","last_name":"Van Leene","first_name":"Jelle"},{"full_name":"De Winne, Nancy","last_name":"De Winne","first_name":"Nancy"},{"last_name":"Eeckhout","first_name":"Dominique","full_name":"Eeckhout, Dominique"},{"first_name":"Geert","last_name":"Persiau","full_name":"Persiau, Geert"},{"full_name":"Van De Slijke, Eveline","first_name":"Eveline","last_name":"Van De Slijke"},{"first_name":"Bernard","last_name":"Cannoot","full_name":"Cannoot, Bernard"},{"last_name":"Vercruysse","first_name":"Leen","full_name":"Vercruysse, Leen"},{"last_name":"Mayers","first_name":"Jonathan","full_name":"Mayers, Jonathan"},{"first_name":"Maciek","last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257","full_name":"Adamowski, Maciek"},{"full_name":"Kania, Urszula","last_name":"Kania","first_name":"Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ehrlich, Matthias","first_name":"Matthias","last_name":"Ehrlich"},{"first_name":"Alois","last_name":"Schweighofer","full_name":"Schweighofer, Alois"},{"full_name":"Ketelaar, Tijs","last_name":"Ketelaar","first_name":"Tijs"},{"first_name":"Steven","last_name":"Maere","full_name":"Maere, Steven"},{"full_name":"Bednarek, Sebastian","last_name":"Bednarek","first_name":"Sebastian"},{"full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"full_name":"Gevaert, Kris","first_name":"Kris","last_name":"Gevaert"},{"first_name":"Erwin","last_name":"Witters","full_name":"Witters, Erwin"},{"first_name":"Eugenia","last_name":"Russinova","full_name":"Russinova, Eugenia"},{"last_name":"Persson","first_name":"Staffan","full_name":"Persson, Staffan"},{"full_name":"De Jaeger, Geert","last_name":"De Jaeger","first_name":"Geert"},{"full_name":"Van Damme, Daniël","first_name":"Daniël","last_name":"Van Damme"}],"date_updated":"2021-01-12T06:56:13Z","date_created":"2018-12-11T11:56:31Z","volume":156,"oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2240","year":"2014","title":"The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants","publication_status":"published","status":"public","intvolume":" 156","publisher":"Cell Press","department":[{"_id":"JiFr"}]},{"month":"01","publication_identifier":{"isbn":["978-145032544-8"]},"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"conference":{"start_date":"2014-01-22","location":"San Diego, USA","end_date":"2014-01-24","name":"POPL: Principles of Programming Languages"},"doi":"10.1145/2535838.2535875","language":[{"iso":"eng"}],"publist_id":"4722","ec_funded":1,"year":"2014","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"ACM","author":[{"full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"date_updated":"2021-01-12T06:56:13Z","date_created":"2018-12-11T11:56:30Z","volume":49,"scopus_import":1,"day":"13","citation":{"chicago":"Boker, Udi, Thomas A Henzinger, and Arjun Radhakrishna. “Battery Transition Systems,” 49:595–606. ACM, 2014. https://doi.org/10.1145/2535838.2535875.","short":"U. Boker, T.A. Henzinger, A. Radhakrishna, in:, ACM, 2014, pp. 595–606.","mla":"Boker, Udi, et al. Battery Transition Systems. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:10.1145/2535838.2535875.","ieee":"U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.","apa":"Boker, U., Henzinger, T. A., & Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM. https://doi.org/10.1145/2535838.2535875","ista":"Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.","ama":"Boker U, Henzinger TA, Radhakrishna A. Battery transition systems. In: Vol 49. ACM; 2014:595-606. doi:10.1145/2535838.2535875"},"page":"595 - 606","date_published":"2014-01-13T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"The analysis of the energy consumption of software is an important goal for quantitative formal methods. Current methods, using weighted transition systems or energy games, model the energy source as an ideal resource whose status is characterized by one number, namely the amount of remaining energy. Real batteries, however, exhibit behaviors that can deviate substantially from an ideal energy resource. Based on a discretization of a standard continuous battery model, we introduce battery transition systems. In this model, a battery is viewed as consisting of two parts-the available-charge tank and the bound-charge tank. Any charge or discharge is applied to the available-charge tank. Over time, the energy from each tank diffuses to the other tank. Battery transition systems are infinite state systems that, being not well-structured, fall into no decidable class that is known to us. Nonetheless, we are able to prove that the !-regular modelchecking problem is decidable for battery transition systems. We also present a case study on the verification of control programs for energy-constrained semi-autonomous robots."}],"issue":"1","_id":"2239","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Battery transition systems","intvolume":" 49","oa_version":"None"},{"publication_identifier":{"issn":["00280836"]},"month":"02","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3985068/"}],"language":[{"iso":"eng"}],"doi":"10.1038/nature12977","publist_id":"4726","publisher":"Nature Publishing Group","department":[{"_id":"SyCr"}],"publication_status":"published","year":"2014","volume":506,"date_updated":"2021-01-12T06:56:11Z","date_created":"2018-12-11T11:56:29Z","author":[{"orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","last_name":"Fürst","first_name":"Matthias","full_name":"Fürst, Matthias"},{"first_name":"Dino","last_name":"Mcmahon","full_name":"Mcmahon, Dino"},{"first_name":"Juliet","last_name":"Osborne","full_name":"Osborne, Juliet"},{"first_name":"Robert","last_name":"Paxton","full_name":"Paxton, Robert"},{"full_name":"Brown, Mark","last_name":"Brown","first_name":"Mark"}],"scopus_import":1,"day":"20","page":"364 - 366","citation":{"short":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, M. Brown, Nature 506 (2014) 364–366.","mla":"Fürst, Matthias, et al. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” Nature, vol. 506, no. 7488, Nature Publishing Group, 2014, pp. 364–66, doi:10.1038/nature12977.","chicago":"Fürst, Matthias, Dino Mcmahon, Juliet Osborne, Robert Paxton, and Mark Brown. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” Nature. Nature Publishing Group, 2014. https://doi.org/10.1038/nature12977.","ama":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. Disease associations between honeybees and bumblebees as a threat to wild pollinators. Nature. 2014;506(7488):364-366. doi:10.1038/nature12977","ieee":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, and M. Brown, “Disease associations between honeybees and bumblebees as a threat to wild pollinators,” Nature, vol. 506, no. 7488. Nature Publishing Group, pp. 364–366, 2014.","apa":"Fürst, M., Mcmahon, D., Osborne, J., Paxton, R., & Brown, M. (2014). Disease associations between honeybees and bumblebees as a threat to wild pollinators. Nature. Nature Publishing Group. https://doi.org/10.1038/nature12977","ista":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. 2014. Disease associations between honeybees and bumblebees as a threat to wild pollinators. Nature. 506(7488), 364–366."},"publication":"Nature","date_published":"2014-02-20T00:00:00Z","type":"journal_article","issue":"7488","abstract":[{"text":"Emerging infectious diseases (EIDs) pose a risk to human welfare, both directly and indirectly, by affecting managed livestock and wildlife that provide valuable resources and ecosystem services, such as the pollination of crops. Honeybees (Apis mellifera), the prevailing managed insect crop pollinator, suffer from a range of emerging and exotic high-impact pathogens, and population maintenance requires active management by beekeepers to control them. Wild pollinators such as bumblebees (Bombus spp.) are in global decline, one cause of which may be pathogen spillover from managed pollinators like honeybees or commercial colonies of bumblebees. Here we use a combination of infection experiments and landscape-scale field data to show that honeybee EIDs are indeed widespread infectious agents within the pollinator assemblage. The prevalence of deformed wing virus (DWV) and the exotic parasite Nosema ceranae in honeybees and bumblebees is linked; as honeybees have higher DWV prevalence, and sympatric bumblebees and honeybees are infected by the same DWV strains, Apis is the likely source of at least one major EID in wild pollinators. Lessons learned from vertebrates highlight the need for increased pathogen control in managed bee species to maintain wild pollinators, as declines in native pollinators may be caused by interspecies pathogen transmission originating from managed pollinators.","lang":"eng"}],"intvolume":" 506","title":"Disease associations between honeybees and bumblebees as a threat to wild pollinators","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2235","oa_version":"Submitted Version"},{"month":"01","day":"22","publication_identifier":{"issn":["08966273"]},"scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2014-01-22T00:00:00Z","doi":"10.1016/j.neuron.2013.11.011","quality_controlled":"1","page":"314 - 320","publication":"Neuron","citation":{"ama":"Beppu K, Sasaki T, Tanaka K, et al. Optogenetic countering of glial acidosis suppresses glial glutamate release and ischemic brain damage. Neuron. 2014;81(2):314-320. doi:10.1016/j.neuron.2013.11.011","ista":"Beppu K, Sasaki T, Tanaka K, Yamanaka A, Fukazawa Y, Shigemoto R, Matsui K. 2014. Optogenetic countering of glial acidosis suppresses glial glutamate release and ischemic brain damage. Neuron. 81(2), 314–320.","ieee":"K. Beppu et al., “Optogenetic countering of glial acidosis suppresses glial glutamate release and ischemic brain damage,” Neuron, vol. 81, no. 2. Elsevier, pp. 314–320, 2014.","apa":"Beppu, K., Sasaki, T., Tanaka, K., Yamanaka, A., Fukazawa, Y., Shigemoto, R., & Matsui, K. (2014). Optogenetic countering of glial acidosis suppresses glial glutamate release and ischemic brain damage. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.11.011","mla":"Beppu, Kaoru, et al. “Optogenetic Countering of Glial Acidosis Suppresses Glial Glutamate Release and Ischemic Brain Damage.” Neuron, vol. 81, no. 2, Elsevier, 2014, pp. 314–20, doi:10.1016/j.neuron.2013.11.011.","short":"K. Beppu, T. Sasaki, K. Tanaka, A. Yamanaka, Y. Fukazawa, R. Shigemoto, K. Matsui, Neuron 81 (2014) 314–320.","chicago":"Beppu, Kaoru, Takuya Sasaki, Kenji Tanaka, Akihiro Yamanaka, Yugo Fukazawa, Ryuichi Shigemoto, and Ko Matsui. “Optogenetic Countering of Glial Acidosis Suppresses Glial Glutamate Release and Ischemic Brain Damage.” Neuron. Elsevier, 2014. https://doi.org/10.1016/j.neuron.2013.11.011."},"abstract":[{"lang":"eng","text":"The brain demands high-energy supply and obstruction of blood flow causes rapid deterioration of the healthiness of brain cells. Two major events occur upon ischemia: acidosis and liberation of excess glutamate, which leads to excitotoxicity. However, cellular source of glutamate and its release mechanism upon ischemia remained unknown. Here we show a causal relationship between glial acidosis and neuronal excitotoxicity. As the major cation that flows through channelrhodopsin-2 (ChR2) is proton, this could be regarded as an optogenetic tool for instant intracellular acidification. Optical activation of ChR2 expressed in glial cells led to glial acidification and to release of glutamate. On the other hand, glial alkalization via optogenetic activation of a proton pump, archaerhodopsin (ArchT), led to cessation of glutamate release and to the relief of ischemic brain damage in vivo. Our results suggest that controlling glial pH may be an effective therapeutic strategy for intervention of ischemic brain damage."}],"publist_id":"4715","issue":"2","type":"journal_article","date_created":"2018-12-11T11:56:31Z","date_updated":"2021-01-12T06:56:14Z","volume":81,"oa_version":"None","author":[{"full_name":"Beppu, Kaoru","last_name":"Beppu","first_name":"Kaoru"},{"first_name":"Takuya","last_name":"Sasaki","full_name":"Sasaki, Takuya"},{"last_name":"Tanaka","first_name":"Kenji","full_name":"Tanaka, Kenji"},{"full_name":"Yamanaka, Akihiro","first_name":"Akihiro","last_name":"Yamanaka"},{"last_name":"Fukazawa","first_name":"Yugo","full_name":"Fukazawa, Yugo"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"full_name":"Matsui, Ko","last_name":"Matsui","first_name":"Ko"}],"title":"Optogenetic countering of glial acidosis suppresses glial glutamate release and ischemic brain damage","publication_status":"published","status":"public","department":[{"_id":"RySh"}],"intvolume":" 81","publisher":"Elsevier","year":"2014","_id":"2241","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"}]