[{"author":[{"full_name":"Schmidt, Tom","first_name":"Tom","last_name":"Schmidt"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"full_name":"Rasic, Gordana","first_name":"Gordana","last_name":"Rasic"},{"full_name":"Turley, Andrew","first_name":"Andrew","last_name":"Turley"},{"first_name":"Brian","full_name":"Montgomery, Brian","last_name":"Montgomery"},{"last_name":"Iturbe Ormaetxe","first_name":"Inaki","full_name":"Iturbe Ormaetxe, Inaki"},{"first_name":"Peter","full_name":"Cook, Peter","last_name":"Cook"},{"first_name":"Peter","full_name":"Ryan, Peter","last_name":"Ryan"},{"first_name":"Scott","full_name":"Ritchie, Scott","last_name":"Ritchie"},{"full_name":"Hoffmann, Ary","first_name":"Ary","last_name":"Hoffmann"},{"last_name":"O’Neill","full_name":"O’Neill, Scott","first_name":"Scott"},{"first_name":"Michael","full_name":"Turelli, Michael","last_name":"Turelli"}],"year":"2017","date_created":"2021-08-10T07:47:07Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ieee":"T. Schmidt et al., “Excel file with data on mosquito densities, Wolbachia infection status and housing characteristics.” Public Library of Science, 2017.","ista":"Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I, Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Excel file with data on mosquito densities, Wolbachia infection status and housing characteristics, Public Library of Science, 10.1371/journal.pbio.2001894.s016.","apa":"Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe, I., … Turelli, M. (2017). Excel file with data on mosquito densities, Wolbachia infection status and housing characteristics. Public Library of Science. https://doi.org/10.1371/journal.pbio.2001894.s016","short":"T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe, P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, (2017).","chicago":"Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery, Inaki Iturbe Ormaetxe, Peter Cook, et al. “Excel File with Data on Mosquito Densities, Wolbachia Infection Status and Housing Characteristics.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pbio.2001894.s016.","ama":"Schmidt T, Barton NH, Rasic G, et al. Excel file with data on mosquito densities, Wolbachia infection status and housing characteristics. 2017. doi:10.1371/journal.pbio.2001894.s016","mla":"Schmidt, Tom, et al. Excel File with Data on Mosquito Densities, Wolbachia Infection Status and Housing Characteristics. Public Library of Science, 2017, doi:10.1371/journal.pbio.2001894.s016."},"month":"05","fulldoi":"https://doi.org/10.1371/journal.pbio.2001894.s016","article_processing_charge":"No","oa_version":"Published Version","status":"public","related_material":{"record":[{"status":"public","id":"951","relation":"used_in_publication"}]},"type":"research_data_reference","date_updated":"2025-07-10T12:01:48Z","_id":"9858","date_published":"2017-05-30T00:00:00Z","doi":"10.1371/journal.pbio.2001894.s016","department":[{"_id":"NiBa"}],"day":"30","publisher":"Public Library of Science","title":"Excel file with data on mosquito densities, Wolbachia infection status and housing characteristics"},{"date_created":"2021-08-10T07:59:02Z","year":"2017","author":[{"full_name":"Greenwood, Jenny","first_name":"Jenny","last_name":"Greenwood"},{"full_name":"Milutinovic, Barbara","first_name":"Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","last_name":"Milutinovic","orcid":"0000-0002-8214-4758"},{"full_name":"Peuß, Robert","first_name":"Robert","last_name":"Peuß"},{"last_name":"Behrens","full_name":"Behrens, Sarah","first_name":"Sarah"},{"first_name":"Daniela","full_name":"Essar, Daniela","last_name":"Essar"},{"last_name":"Rosenstiel","full_name":"Rosenstiel, Philip","first_name":"Philip"},{"first_name":"Hinrich","full_name":"Schulenburg, Hinrich","last_name":"Schulenburg"},{"first_name":"Joachim","full_name":"Kurtz, Joachim","last_name":"Kurtz"}],"article_processing_charge":"No","oa_version":"Published Version","fulldoi":"https://doi.org/10.6084/m9.figshare.c.3756974_d1.v1","month":"04","citation":{"apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. Springer Nature. https://doi.org/10.6084/m9.figshare.c.3756974_d1.v1","ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae, Springer Nature, 10.6084/m9.figshare.c.3756974_d1.v1.","ieee":"J. Greenwood et al., “Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae.” Springer Nature, 2017.","short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, (2017).","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Additional File 1: Table S1. of Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” Springer Nature, 2017. https://doi.org/10.6084/m9.figshare.c.3756974_d1.v1.","mla":"Greenwood, Jenny, et al. Additional File 1: Table S1. of Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae. Springer Nature, 2017, doi:10.6084/m9.figshare.c.3756974_d1.v1.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. 2017. doi:10.6084/m9.figshare.c.3756974_d1.v1"},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.c.3756974_d1.v1","open_access":"1"}],"_id":"9859","date_published":"2017-04-26T00:00:00Z","doi":"10.6084/m9.figshare.c.3756974_d1.v1","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1006"}]},"status":"public","type":"research_data_reference","date_updated":"2025-07-10T11:49:39Z","title":"Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","oa":1,"abstract":[{"lang":"eng","text":"Lists of all differentially expressed genes in the different priming-challenge treatments (compared to the fully naïve control; xlsx file). Relevant columns include the following: sample_1 and sample_2 – treatment groups being compared; Normalised FPKM sample_1 and sample_2 – FPKM of samples being compared; log2(fold_change) – log2(FPKM sample 2/FPKM sample 1), i.e. negative means sample 1 upregulated compared with sample 2, positive means sample 2 upregulated compared with sample 1; cuffdiff test_statistic – test statistic of differential expression test; p_value – p-value of differential expression test; q_value (FDR correction) – adjusted P-value of differential expression test. (XLSX 598 kb)"}],"department":[{"_id":"SyCr"}],"publisher":"Springer Nature","day":"26"},{"_id":"9860","date_published":"2017-04-26T00:00:00Z","doi":"10.6084/m9.figshare.c.3756974_d5.v1","status":"public","related_material":{"record":[{"status":"public","id":"1006","relation":"used_in_publication"}]},"type":"research_data_reference","date_updated":"2025-07-10T11:49:39Z","publisher":"Springer Nature","day":"26","department":[{"_id":"SyCr"}],"title":"Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","oa":1,"year":"2017","author":[{"first_name":"Jenny","full_name":"Greenwood, Jenny","last_name":"Greenwood"},{"last_name":"Milutinovic","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8214-4758","full_name":"Milutinovic, Barbara","first_name":"Barbara"},{"first_name":"Robert","full_name":"Peuß, Robert","last_name":"Peuß"},{"full_name":"Behrens, Sarah","first_name":"Sarah","last_name":"Behrens"},{"full_name":"Essar, Daniela","first_name":"Daniela","last_name":"Essar"},{"full_name":"Rosenstiel, Philip","first_name":"Philip","last_name":"Rosenstiel"},{"last_name":"Schulenburg","full_name":"Schulenburg, Hinrich","first_name":"Hinrich"},{"last_name":"Kurtz","full_name":"Kurtz, Joachim","first_name":"Joachim"}],"date_created":"2021-08-10T08:07:12Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, (2017).","apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. Springer Nature. https://doi.org/10.6084/m9.figshare.c.3756974_d5.v1","ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae, Springer Nature, 10.6084/m9.figshare.c.3756974_d5.v1.","ieee":"J. Greenwood et al., “Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae.” Springer Nature, 2017.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. 2017. doi:10.6084/m9.figshare.c.3756974_d5.v1","mla":"Greenwood, Jenny, et al. Additional File 5: Table S3. of Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae. Springer Nature, 2017, doi:10.6084/m9.figshare.c.3756974_d5.v1.","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Additional File 5: Table S3. of Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” Springer Nature, 2017. https://doi.org/10.6084/m9.figshare.c.3756974_d5.v1."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.c.3756974_d5.v1"}],"article_processing_charge":"No","oa_version":"Published Version","fulldoi":"https://doi.org/10.6084/m9.figshare.c.3756974_d5.v1","month":"04"},{"date_created":"2021-08-10T08:12:52Z","year":"2017","author":[{"last_name":"Argyridou","first_name":"Eliza","full_name":"Argyridou, Eliza"},{"id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8871-4961","last_name":"Huylmans","full_name":"Huylmans, Ann K","first_name":"Ann K"},{"last_name":"Königer","full_name":"Königer, Annabella","first_name":"Annabella"},{"last_name":"Parsch","full_name":"Parsch, John","first_name":"John"}],"article_processing_charge":"No","oa_version":"Published Version","fulldoi":"https://doi.org/10.5061/dryad.02f6r","month":"02","citation":{"mla":"Argyridou, Eliza, et al. Data from: X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster. Dryad, 2017, doi:10.5061/dryad.02f6r.","ama":"Argyridou E, Huylmans AK, Königer A, Parsch J. Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. 2017. doi:10.5061/dryad.02f6r","chicago":"Argyridou, Eliza, Ann K Huylmans, Annabella Königer, and John Parsch. “Data from: X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” Dryad, 2017. https://doi.org/10.5061/dryad.02f6r.","short":"E. Argyridou, A.K. Huylmans, A. Königer, J. Parsch, (2017).","apa":"Argyridou, E., Huylmans, A. K., Königer, A., & Parsch, J. (2017). Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. Dryad. https://doi.org/10.5061/dryad.02f6r","ista":"Argyridou E, Huylmans AK, Königer A, Parsch J. 2017. Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster, Dryad, 10.5061/dryad.02f6r.","ieee":"E. Argyridou, A. K. Huylmans, A. Königer, and J. Parsch, “Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster.” Dryad, 2017."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.02f6r"}],"_id":"9861","doi":"10.5061/dryad.02f6r","date_published":"2017-02-14T00:00:00Z","status":"public","type":"research_data_reference","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1019"}]},"date_updated":"2025-07-10T11:49:45Z","title":"Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster","oa":1,"abstract":[{"text":"As a consequence of its difference in copy number between males and females, the X chromosome is subject to unique evolutionary forces and gene regulatory mechanisms. Previous studies of Drosophila melanogaster have shown that the expression of X-linked, testis-specific reporter genes is suppressed in the male germline. However, it is not known whether this phenomenon is restricted to testis-expressed genes or if it is a more general property of genes with tissue-specific expression, which are also underrepresented on the X chromosome. To test this, we compared the expression of three tissue-specific reporter genes (ovary, accessory gland and Malpighian tubule) inserted at various autosomal and X-chromosomal locations. In contrast to testis-specific reporter genes, we found no reduction of X-linked expression in any of the other tissues. In accessory gland and Malpighian tubule, we detected higher expression of the X-linked reporter genes, which suggests that they are at least partially dosage compensated. We found no difference in the tissue-specificity of X-linked and autosomal reporter genes. These findings indicate that, in general, the X chromosome is not a detrimental environment for tissue-specific gene expression and that the suppression of X-linked expression is limited to the male germline.","lang":"eng"}],"day":"14","publisher":"Dryad","department":[{"_id":"BeVi"}]},{"year":"2017","citation":{"ama":"Nanda G, Aguilera Servin JL, Rakyta P, et al. Current-phase relation of ballistic graphene Josephson junctions. Nano Letters. 2017;17(6):3396-3401. doi:10.1021/acs.nanolett.7b00097","mla":"Nanda, Gaurav, et al. “Current-Phase Relation of Ballistic Graphene Josephson Junctions.” Nano Letters, vol. 17, no. 6, American Chemical Society, 2017, pp. 3396–401, doi:10.1021/acs.nanolett.7b00097.","chicago":"Nanda, Gaurav, Juan L Aguilera Servin, Péter Rakyta, Andor Kormányos, Reinhold Kleiner, Dieter Koelle, Kazuo Watanabe, Takashi Taniguchi, Lieven Vandersypen, and Srijit Goswami. “Current-Phase Relation of Ballistic Graphene Josephson Junctions.” Nano Letters. American Chemical Society, 2017. https://doi.org/10.1021/acs.nanolett.7b00097.","short":"G. Nanda, J.L. Aguilera Servin, P. Rakyta, A. Kormányos, R. Kleiner, D. Koelle, K. Watanabe, T. Taniguchi, L. Vandersypen, S. Goswami, Nano Letters 17 (2017) 3396–3401.","apa":"Nanda, G., Aguilera Servin, J. L., Rakyta, P., Kormányos, A., Kleiner, R., Koelle, D., … Goswami, S. (2017). Current-phase relation of ballistic graphene Josephson junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b00097","ieee":"G. Nanda et al., “Current-phase relation of ballistic graphene Josephson junctions,” Nano Letters, vol. 17, no. 6. American Chemical Society, pp. 3396–3401, 2017.","ista":"Nanda G, Aguilera Servin JL, Rakyta P, Kormányos A, Kleiner R, Koelle D, Watanabe K, Taniguchi T, Vandersypen L, Goswami S. 2017. Current-phase relation of ballistic graphene Josephson junctions. Nano Letters. 17(6), 3396–3401."},"file":[{"file_size":508638,"relation":"main_file","content_type":"application/pdf","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:13:50Z","date_updated":"2020-07-14T12:48:18Z","file_id":"5037","file_name":"IST-2017-826-v1+1_2017_Aguilera-Servin_Current.pdf","checksum":"22021daa90cf13b01becd776838acb7b"}],"intvolume":" 17","volume":17,"issue":"6","date_published":"2017-05-05T00:00:00Z","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"doi":"10.1021/acs.nanolett.7b00097","_id":"988","date_updated":"2025-07-10T12:02:04Z","type":"journal_article","status":"public","pubrep_id":"826","external_id":{"isi":["000403631600011"]},"abstract":[{"text":"The current-phase relation (CPR) of a Josephson junction (JJ) determines how the supercurrent evolves with the superconducting phase difference across the junction. Knowledge of the CPR is essential in order to understand the response of a JJ to various external parameters. Despite the rising interest in ultraclean encapsulated graphene JJs, the CPR of such junctions remains unknown. Here, we use a fully gate-tunable graphene superconducting quantum intereference device (SQUID) to determine the CPR of ballistic graphene JJs. Each of the two JJs in the SQUID is made with graphene encapsulated in hexagonal boron nitride. By independently controlling the critical current of the JJs, we can operate the SQUID either in a symmetric or asymmetric configuration. The highly asymmetric SQUID allows us to phase-bias one of the JJs and thereby directly obtain its CPR. The CPR is found to be skewed, deviating significantly from a sinusoidal form. The skewness can be tuned with the gate voltage and oscillates in antiphase with Fabry-Pérot resistance oscillations of the ballistic graphene cavity. We compare our experiments with tight-binding calculations that include realistic graphene-superconductor interfaces and find a good qualitative agreement.","lang":"eng"}],"publist_id":"6412","oa":1,"publication_identifier":{"issn":["1530-6984"]},"title":"Current-phase relation of ballistic graphene Josephson junctions","file_date_updated":"2020-07-14T12:48:18Z","author":[{"last_name":"Nanda","full_name":"Nanda, Gaurav","first_name":"Gaurav"},{"full_name":"Aguilera Servin, Juan L","first_name":"Juan L","orcid":"0000-0002-2862-8372","id":"2A67C376-F248-11E8-B48F-1D18A9856A87","last_name":"Aguilera Servin"},{"last_name":"Rakyta","full_name":"Rakyta, Péter","first_name":"Péter"},{"first_name":"Andor","full_name":"Kormányos, Andor","last_name":"Kormányos"},{"first_name":"Reinhold","full_name":"Kleiner, Reinhold","last_name":"Kleiner"},{"full_name":"Koelle, Dieter","first_name":"Dieter","last_name":"Koelle"},{"last_name":"Watanabe","first_name":"Kazuo","full_name":"Watanabe, Kazuo"},{"full_name":"Taniguchi, Takashi","first_name":"Takashi","last_name":"Taniguchi"},{"last_name":"Vandersypen","full_name":"Vandersypen, Lieven","first_name":"Lieven"},{"first_name":"Srijit","full_name":"Goswami, Srijit","last_name":"Goswami"}],"has_accepted_license":"1","date_created":"2018-12-11T11:49:33Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","page":"3396 - 3401","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","article_processing_charge":"No","fulldoi":"https://doi.org/10.1021/acs.nanolett.7b00097","quality_controlled":"1","month":"05","publication":"Nano Letters","publication_status":"published","language":[{"iso":"eng"}],"ddc":["621"],"day":"05","department":[{"_id":"NanoFab"}],"publisher":"American Chemical Society","isi":1,"scopus_import":"1"},{"fulldoi":"https://doi.org/10.1007/978-3-319-58771-4_45","quality_controlled":"1","month":"05","oa_version":"None","article_processing_charge":"No","editor":[{"first_name":"François","full_name":"Lauze, François","last_name":"Lauze"},{"last_name":"Dong","first_name":"Yiqiu","full_name":"Dong, Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","first_name":"Anders","last_name":"Bjorholm Dahl"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"563 - 577","date_created":"2018-12-11T11:49:34Z","author":[{"orcid":"0000-0002-0845-1338","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","first_name":"Jan"},{"full_name":"Rumpf, Martin","first_name":"Martin","last_name":"Rumpf"},{"first_name":"Stefan","full_name":"Simon, Stefan","last_name":"Simon"}],"scopus_import":"1","isi":1,"day":"18","conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04","location":"Kolding, Denmark","end_date":"2017-06-08"},"department":[{"_id":"JaMa"}],"publisher":"Springer","publication_status":"published","language":[{"iso":"eng"}],"intvolume":" 10302","alternative_title":["LNCS"],"citation":{"chicago":"Maas, Jan, Martin Rumpf, and Stefan Simon. “Transport Based Image Morphing with Intensity Modulation.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:563–77. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_45.","mla":"Maas, Jan, et al. Transport Based Image Morphing with Intensity Modulation. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 563–77, doi:10.1007/978-3-319-58771-4_45.","ama":"Maas J, Rumpf M, Simon S. Transport based image morphing with intensity modulation. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:563-577. doi:10.1007/978-3-319-58771-4_45","ista":"Maas J, Rumpf M, Simon S. 2017. Transport based image morphing with intensity modulation. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 563–577.","ieee":"J. Maas, M. Rumpf, and S. Simon, “Transport based image morphing with intensity modulation,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 563–577.","apa":"Maas, J., Rumpf, M., & Simon, S. (2017). Transport based image morphing with intensity modulation. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 563–577). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_45","short":"J. Maas, M. Rumpf, S. Simon, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 563–577."},"year":"2017","publication_identifier":{"issn":["0302-9743"]},"title":"Transport based image morphing with intensity modulation","publist_id":"6410","external_id":{"isi":["000432210900045"]},"abstract":[{"text":"We present a generalized optimal transport model in which the mass-preserving constraint for the L2-Wasserstein distance is relaxed by introducing a source term in the continuity equation. The source term is also incorporated in the path energy by means of its squared L2-norm in time of a functional with linear growth in space. This extension of the original transport model enables local density modulations, which is a desirable feature in applications such as image warping and blending. A key advantage of the use of a functional with linear growth in space is that it allows for singular sources and sinks, which can be supported on points or lines. On a technical level, the L2-norm in time ensures a disintegration of the source in time, which we use to obtain the well-posedness of the model and the existence of geodesic paths. The numerical discretization is based on the proximal splitting approach [18] and selected numerical test cases show the potential of the proposed approach. Furthermore, the approach is applied to the warping and blending of textures.","lang":"eng"}],"date_updated":"2026-04-16T10:05:10Z","type":"conference","status":"public","date_published":"2017-05-18T00:00:00Z","doi":"10.1007/978-3-319-58771-4_45","_id":"989","volume":10302},{"file_date_updated":"2020-07-14T12:48:18Z","publication_identifier":{"issn":["0014-3820"]},"title":"Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow","oa":1,"publist_id":"6409","abstract":[{"text":"Assortative mating is an important driver of speciation in populations with gene flow and is predicted to evolve under certain conditions in few-locus models. However, the evolution of assortment is less understood for mating based on quantitative traits, which are often characterized by high genetic variability and extensive linkage disequilibrium between trait loci. We explore this scenario for a two-deme model with migration, by considering a single polygenic trait subject to divergent viability selection across demes, as well as assortative mating and sexual selection within demes, and investigate how trait divergence is shaped by various evolutionary forces. Our analysis reveals the existence of sharp thresholds of assortment strength, at which divergence increases dramatically. We also study the evolution of assortment via invasion of modifiers of mate discrimination and show that the ES assortment strength has an intermediate value under a range of migration-selection parameters, even in diverged populations, due to subtle effects which depend sensitively on the extent of phenotypic variation within these populations. The evolutionary dynamics of the polygenic trait is studied using the hypergeometric and infinitesimal models. We further investigate the sensitivity of our results to the assumptions of the hypergeometric model, using individual-based simulations.","lang":"eng"}],"external_id":{"isi":["000403014800005"],"pmid":["28419447"]},"pubrep_id":"977","type":"journal_article","status":"public","date_updated":"2025-07-10T12:02:04Z","_id":"990","date_published":"2017-06-01T00:00:00Z","doi":"10.1111/evo.13252","issue":"6","volume":71,"intvolume":" 71","ec_funded":1,"file":[{"creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":625260,"checksum":"6d4c38cb1347fd43620d1736c6df5c79","file_id":"6329","file_name":"2017_Evolution_Sachdeva_supplement.pdf","date_updated":"2020-07-14T12:48:18Z","access_level":"open_access","date_created":"2019-04-17T07:37:04Z"},{"creator":"dernst","file_size":520110,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2019-04-17T07:37:04Z","date_updated":"2020-07-14T12:48:18Z","file_name":"2017_Evolution_Sachdeva_article.pdf","file_id":"6330","checksum":"f1d90dd8831b44baf49b4dd176f263af"}],"citation":{"short":"H. Sachdeva, N.H. Barton, Evolution; International Journal of Organic Evolution 71 (2017) 1478–1493.","ista":"Sachdeva H, Barton NH. 2017. Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow. Evolution; International Journal of Organic Evolution. 71(6), 1478–1493.","ieee":"H. Sachdeva and N. H. Barton, “Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow,” Evolution; International Journal of Organic Evolution, vol. 71, no. 6. Wiley-Blackwell, pp. 1478–1493, 2017.","apa":"Sachdeva, H., & Barton, N. H. (2017). Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow. Evolution; International Journal of Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/evo.13252","mla":"Sachdeva, Himani, and Nicholas H. Barton. “Divergence and Evolution of Assortative Mating in a Polygenic Trait Model of Speciation with Gene Flow.” Evolution; International Journal of Organic Evolution, vol. 71, no. 6, Wiley-Blackwell, 2017, pp. 1478–93, doi:10.1111/evo.13252.","ama":"Sachdeva H, Barton NH. Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow. Evolution; International Journal of Organic Evolution. 2017;71(6):1478-1493. doi:10.1111/evo.13252","chicago":"Sachdeva, Himani, and Nicholas H Barton. “Divergence and Evolution of Assortative Mating in a Polygenic Trait Model of Speciation with Gene Flow.” Evolution; International Journal of Organic Evolution. Wiley-Blackwell, 2017. https://doi.org/10.1111/evo.13252."},"year":"2017","scopus_import":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"}],"isi":1,"publisher":"Wiley-Blackwell","day":"01","department":[{"_id":"NiBa"}],"pmid":1,"language":[{"iso":"eng"}],"ddc":["576"],"publication_status":"published","publication":"Evolution; International Journal of Organic Evolution","quality_controlled":"1","fulldoi":"https://doi.org/10.1111/evo.13252","month":"06","article_processing_charge":"No","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1478 - 1493 ","date_created":"2018-12-11T11:49:34Z","corr_author":"1","has_accepted_license":"1","author":[{"first_name":"Himani","full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","last_name":"Sachdeva"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}]},{"publisher":"Elsevier","day":"17","department":[{"_id":"PeJo"}],"scopus_import":"1","isi":1,"publication":"Neuron","publication_status":"published","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","fulldoi":"https://doi.org/10.1016/j.neuron.2017.05.011","month":"05","quality_controlled":"1","oa_version":"None","article_processing_charge":"No","author":[{"id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","full_name":"Chen, Chong","first_name":"Chong"},{"first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:49:34Z","page":"694 - 696","external_id":{"isi":["000401415100002"]},"abstract":[{"lang":"eng","text":"Synaptotagmin 7 (Syt7) was originally identified as a slow Ca2+ sensor for lysosome fusion, but its function at fast synapses is controversial. The paper by Luo and Südhof (2017) in this issue of Neuron shows that at the calyx of Held in the auditory brainstem Syt7 triggers asynchronous release during stimulus trains, resulting in reliable and temporally precise high-frequency transmission. Thus, a slow Ca2+ sensor contributes to the fast signaling properties of the calyx synapse."}],"publication_identifier":{"issn":["0896-6273"]},"title":"Synaptotagmins: That’s why so many","publist_id":"6408","issue":"4","volume":94,"date_updated":"2026-04-16T10:05:51Z","type":"journal_article","status":"public","doi":"10.1016/j.neuron.2017.05.011","date_published":"2017-05-17T00:00:00Z","_id":"991","citation":{"ieee":"C. Chen and P. M. Jonas, “Synaptotagmins: That’s why so many,” Neuron, vol. 94, no. 4. Elsevier, pp. 694–696, 2017.","ista":"Chen C, Jonas PM. 2017. Synaptotagmins: That’s why so many. Neuron. 94(4), 694–696.","apa":"Chen, C., & Jonas, P. M. (2017). Synaptotagmins: That’s why so many. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2017.05.011","short":"C. Chen, P.M. Jonas, Neuron 94 (2017) 694–696.","chicago":"Chen, Chong, and Peter M Jonas. “Synaptotagmins: That’s Why so Many.” Neuron. Elsevier, 2017. https://doi.org/10.1016/j.neuron.2017.05.011.","ama":"Chen C, Jonas PM. Synaptotagmins: That’s why so many. Neuron. 2017;94(4):694-696. doi:10.1016/j.neuron.2017.05.011","mla":"Chen, Chong, and Peter M. Jonas. “Synaptotagmins: That’s Why so Many.” Neuron, vol. 94, no. 4, Elsevier, 2017, pp. 694–96, doi:10.1016/j.neuron.2017.05.011."},"intvolume":" 94","year":"2017"},{"article_processing_charge":"No","oa_version":"Published Version","month":"05","fulldoi":"https://doi.org/10.15479/AT:ISTA:th_815","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","date_created":"2018-12-11T11:49:35Z","page":"97","has_accepted_license":"1","author":[{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","full_name":"Rolinek, Michal","first_name":"Michal"}],"acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","supervisor":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"project":[{"call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"degree_awarded":"PhD","day":"01","publisher":"Institute of Science and Technology Austria","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"ddc":["004"],"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","file_size":786145,"creator":"system","checksum":"81761fb939acb7585c36629f765b4373","file_id":"4654","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","date_updated":"2020-07-14T12:48:18Z","access_level":"open_access","date_created":"2018-12-12T10:07:55Z"},{"content_type":"application/zip","relation":"source_file","file_size":5936337,"creator":"dernst","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","file_id":"6208","file_name":"2017_Thesis_Rolinek_source.zip","date_updated":"2020-07-14T12:48:18Z","access_level":"closed","date_created":"2019-04-05T08:43:24Z"}],"alternative_title":["ISTA Thesis"],"ec_funded":1,"citation":{"ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","apa":"Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815","mla":"Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815."},"year":"2017","publist_id":"6407","OA_place":"publisher","title":"Complexity of constraint satisfaction","file_date_updated":"2020-07-14T12:48:18Z","publication_identifier":{"issn":["2663-337X"]},"oa":1,"pubrep_id":"815","abstract":[{"text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language).","lang":"eng"}],"_id":"992","date_published":"2017-05-01T00:00:00Z","doi":"10.15479/AT:ISTA:th_815","type":"dissertation","status":"public","date_updated":"2026-04-08T14:17:06Z"},{"year":"2017","intvolume":" 8","ec_funded":1,"file":[{"checksum":"9880212f8c4c53404c7c6fbf9023c53a","file_id":"5122","file_name":"IST-2017-819-v1+1_2017_Levina_SubsamplingScaling.pdf","date_updated":"2020-07-14T12:48:19Z","date_created":"2018-12-12T10:15:05Z","access_level":"open_access","creator":"system","content_type":"application/pdf","relation":"main_file","file_size":746224}],"citation":{"mla":"Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature Communications, vol. 8, 15140, Nature Publishing Group, 2017, doi:10.1038/ncomms15140.","ama":"Levina (Martius) A, Priesemann V. Subsampling scaling. Nature Communications. 2017;8. doi:10.1038/ncomms15140","chicago":"Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms15140.","short":"A. Levina (Martius), V. Priesemann, Nature Communications 8 (2017).","ista":"Levina (Martius) A, Priesemann V. 2017. Subsampling scaling. Nature Communications. 8, 15140.","ieee":"A. Levina (Martius) and V. Priesemann, “Subsampling scaling,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Levina (Martius), A., & Priesemann, V. (2017). Subsampling scaling. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms15140"},"type":"journal_article","status":"public","date_updated":"2025-07-10T12:02:06Z","_id":"993","date_published":"2017-05-04T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"doi":"10.1038/ncomms15140","article_number":"15140","volume":8,"title":"Subsampling scaling","publication_identifier":{"issn":["2041-1723"]},"file_date_updated":"2020-07-14T12:48:19Z","oa":1,"publist_id":"6406","abstract":[{"text":"In real-world applications, observations are often constrained to a small fraction of a system. Such spatial subsampling can be caused by the inaccessibility or the sheer size of the system, and cannot be overcome by longer sampling. Spatial subsampling can strongly bias inferences about a system’s aggregated properties. To overcome the bias, we derive analytically a subsampling scaling framework that is applicable to different observables, including distributions of neuronal avalanches, of number of people infected during an epidemic outbreak, and of node degrees. We demonstrate how to infer the correct distributions of the underlying full system, how to apply it to distinguish critical from subcritical systems, and how to disentangle subsampling and finite size effects. Lastly, we apply subsampling scaling to neuronal avalanche models and to recordings from developing neural networks. We show that only mature, but not young networks follow power-law scaling, indicating self-organization to criticality during development.","lang":"eng"}],"external_id":{"isi":["000400560700001"]},"pubrep_id":"819","license":"https://creativecommons.org/licenses/by/4.0/","date_created":"2018-12-11T11:49:35Z","has_accepted_license":"1","author":[{"first_name":"Anna","full_name":"Levina (Martius), Anna","last_name":"Levina (Martius)","id":"35AF8020-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Priesemann","full_name":"Priesemann, Viola","first_name":"Viola"}],"fulldoi":"https://doi.org/10.1038/ncomms15140","quality_controlled":"1","month":"05","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005","571"],"language":[{"iso":"eng"}],"publication_status":"published","publication":"Nature Communications","scopus_import":"1","isi":1,"project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"day":"04","department":[{"_id":"GaTk"},{"_id":"JoCs"}],"publisher":"Nature Publishing Group"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Submitted Version","quality_controlled":"1","fulldoi":"https://doi.org/10.1103/PhysRevMaterials.1.035602","month":"08","author":[{"full_name":"Cherepanov, Igor","first_name":"Igor","last_name":"Cherepanov","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail"}],"corr_author":"1","date_created":"2018-12-11T11:49:35Z","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"day":"08","isi":1,"project":[{"call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","publication":"Physical Review Materials","language":[{"iso":"eng"}],"publication_status":"published","citation":{"short":"I. Cherepanov, M. Lemeshko, Physical Review Materials 1 (2017).","ista":"Cherepanov I, Lemeshko M. 2017. Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. Physical Review Materials. 1(3).","ieee":"I. Cherepanov and M. Lemeshko, “Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules,” Physical Review Materials, vol. 1, no. 3. American Physical Society, 2017.","apa":"Cherepanov, I., & Lemeshko, M. (2017). Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. Physical Review Materials. American Physical Society. https://doi.org/10.1103/PhysRevMaterials.1.035602","ama":"Cherepanov I, Lemeshko M. Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. Physical Review Materials. 2017;1(3). doi:10.1103/PhysRevMaterials.1.035602","mla":"Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials, vol. 1, no. 3, American Physical Society, 2017, doi:10.1103/PhysRevMaterials.1.035602.","chicago":"Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials. American Physical Society, 2017. https://doi.org/10.1103/PhysRevMaterials.1.035602."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.09220"}],"arxiv":1,"intvolume":" 1","ec_funded":1,"year":"2017","abstract":[{"lang":"eng","text":"The formation of vortices is usually considered to be the main mechanism of angular momentum disposal in superfluids. Recently, it was predicted that a superfluid can acquire angular momentum via an alternative, microscopic route -- namely, through interaction with rotating impurities, forming so-called `angulon quasiparticles' [Phys. Rev. Lett. 114, 203001 (2015)]. The angulon instabilities correspond to transfer of a small number of angular momentum quanta from the impurity to the superfluid, as opposed to vortex instabilities, where angular momentum is quantized in units of ℏ per atom. Furthermore, since conventional impurities (such as molecules) represent three-dimensional (3D) rotors, the angular momentum transferred is intrinsically 3D as well, as opposed to a merely planar rotation which is inherent to vortices. Herein we show that the angulon theory can explain the anomalous broadening of the spectroscopic lines observed for CH 3 and NH 3 molecules in superfluid helium nanodroplets, thereby providing a fingerprint of the emerging angulon instabilities in experiment."}],"external_id":{"arxiv":["1705.09220"],"isi":["000416564000004"]},"publist_id":"6405","title":"Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules","oa":1,"volume":1,"issue":"3","_id":"994","doi":"10.1103/PhysRevMaterials.1.035602","date_published":"2017-08-08T00:00:00Z","type":"journal_article","status":"public","date_updated":"2025-06-04T10:15:04Z"},{"year":"2017","intvolume":" 147","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.03684"}],"arxiv":1,"citation":{"short":"B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko, H. Stapelfeldt, The Journal of Chemical Physics 147 (2017).","apa":"Shepperson, B., Chatterley, A., Søndergaard, A., Christiansen, L., Lemeshko, M., & Stapelfeldt, H. (2017). Strongly aligned molecules inside helium droplets in the near-adiabatic regime. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/1.4983703","ieee":"B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko, and H. Stapelfeldt, “Strongly aligned molecules inside helium droplets in the near-adiabatic regime,” The Journal of Chemical Physics, vol. 147, no. 1. AIP Publishing, 2017.","ista":"Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt H. 2017. Strongly aligned molecules inside helium droplets in the near-adiabatic regime. The Journal of Chemical Physics. 147(1), 013946.","ama":"Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt H. Strongly aligned molecules inside helium droplets in the near-adiabatic regime. The Journal of Chemical Physics. 2017;147(1). doi:10.1063/1.4983703","mla":"Shepperson, Benjamin, et al. “Strongly Aligned Molecules inside Helium Droplets in the Near-Adiabatic Regime.” The Journal of Chemical Physics, vol. 147, no. 1, 013946, AIP Publishing, 2017, doi:10.1063/1.4983703.","chicago":"Shepperson, Benjamin, Adam Chatterley, Anders Søndergaard, Lars Christiansen, Mikhail Lemeshko, and Henrik Stapelfeldt. “Strongly Aligned Molecules inside Helium Droplets in the Near-Adiabatic Regime.” The Journal of Chemical Physics. AIP Publishing, 2017. https://doi.org/10.1063/1.4983703."},"type":"journal_article","status":"public","date_updated":"2025-06-04T08:17:46Z","_id":"996","date_published":"2017-06-01T00:00:00Z","doi":"10.1063/1.4983703","article_number":"013946","issue":"1","volume":147,"title":"Strongly aligned molecules inside helium droplets in the near-adiabatic regime","publication_identifier":{"issn":["0021-9606"]},"oa":1,"publist_id":"6403","abstract":[{"lang":"eng","text":"Iodine (I 2 ) molecules embedded in He nanodroplets are aligned by a 160 ps long laser pulse. The highest degree of alignment, occurring at the peak of the pulse and quantified by ⟨cos 2 θ 2D ⟩ , is measured as a function of the laser intensity. The results are well described by ⟨cos 2 θ 2D ⟩ calculated for a gas of isolated molecules each with an effective rotational constant of 0.6 times the gas-phase value, and at a temperature of 0.4 K. Theoretical analysis using the angulon quasiparticle to describe rotating molecules in superfluid helium rationalizes why the alignment mechanism is similar to that of isolated molecules with an effective rotational constant. A major advantage of molecules in He droplets is that their 0.4 K temperature leads to stronger alignment than what can generally be achieved for gas phase molecules -- here demonstrated by a direct comparison of the droplet results to measurements on a ∼ 1 K supersonic beam of isolated molecules. This point is further illustrated for more complex system by measurements on 1,4-diiodobenzene and 1,4-dibromobenzene. For all three molecular species studied the highest values of ⟨cos 2 θ 2D ⟩ achieved in He droplets exceed 0.96. "}],"external_id":{"arxiv":["1704.03684"],"isi":["000405089400047"]},"date_created":"2018-12-11T11:49:36Z","author":[{"last_name":"Shepperson","full_name":"Shepperson, Benjamin","first_name":"Benjamin"},{"last_name":"Chatterley","full_name":"Chatterley, Adam","first_name":"Adam"},{"first_name":"Anders","full_name":"Søndergaard, Anders","last_name":"Søndergaard"},{"last_name":"Christiansen","full_name":"Christiansen, Lars","first_name":"Lars"},{"orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","first_name":"Mikhail"},{"last_name":"Stapelfeldt","first_name":"Henrik","full_name":"Stapelfeldt, Henrik"}],"month":"06","fulldoi":"https://doi.org/10.1063/1.4983703","quality_controlled":"1","article_processing_charge":"No","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication_status":"published","publication":"The Journal of Chemical Physics","scopus_import":"1","isi":1,"publisher":"AIP Publishing","day":"01","department":[{"_id":"MiLe"}]},{"title":"Emergence of non-abelian magnetic monopoles in a quantum impurity problem","publication_identifier":{"issn":["0031-9007"]},"oa":1,"publist_id":"6401","abstract":[{"text":"Recently it was shown that molecules rotating in superfluid helium can be described in terms of the angulon quasiparticles (Phys. Rev. Lett. 118, 095301 (2017)). Here we demonstrate that in the experimentally realized regime the angulon can be seen as a point charge on a 2-sphere interacting with a gauge field of a non-abelian magnetic monopole. Unlike in several other settings, the gauge fields of the angulon problem emerge in the real coordinate space, as opposed to the momentum space or some effective parameter space. Furthermore, we find a topological transition associated with making the monopole abelian, which takes place in the vicinity of the previously reported angulon instabilities. These results pave the way for studying topological phenomena in experiments on molecules trapped in superfluid helium nanodroplets, as well as on other realizations of orbital impurity problems.","lang":"eng"}],"external_id":{"arxiv":["1705.05162"],"isi":["000417132100007"]},"type":"journal_article","status":"public","date_updated":"2025-04-14T07:26:54Z","_id":"997","doi":"10.1103/PhysRevLett.119.235301","date_published":"2017-12-06T00:00:00Z","issue":"23","article_number":"235301","volume":119,"intvolume":" 119","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.05162","open_access":"1"}],"arxiv":1,"citation":{"short":"E. Yakaboylu, A. Deuchert, M. Lemeshko, Physical Review Letters 119 (2017).","ieee":"E. Yakaboylu, A. Deuchert, and M. Lemeshko, “Emergence of non-abelian magnetic monopoles in a quantum impurity problem,” Physical Review Letters, vol. 119, no. 23. American Physical Society, 2017.","ista":"Yakaboylu E, Deuchert A, Lemeshko M. 2017. Emergence of non-abelian magnetic monopoles in a quantum impurity problem. Physical Review Letters. 119(23), 235301.","apa":"Yakaboylu, E., Deuchert, A., & Lemeshko, M. (2017). Emergence of non-abelian magnetic monopoles in a quantum impurity problem. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.235301","ama":"Yakaboylu E, Deuchert A, Lemeshko M. Emergence of non-abelian magnetic monopoles in a quantum impurity problem. Physical Review Letters. 2017;119(23). doi:10.1103/PhysRevLett.119.235301","mla":"Yakaboylu, Enderalp, et al. “Emergence of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” Physical Review Letters, vol. 119, no. 23, 235301, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.235301.","chicago":"Yakaboylu, Enderalp, Andreas Deuchert, and Mikhail Lemeshko. “Emergence of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.235301."},"year":"2017","scopus_import":"1","isi":1,"project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020"},{"_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","grant_number":"P29902","call_identifier":"FWF"}],"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"American Physical Society","day":"06","language":[{"iso":"eng"}],"article_type":"original","publication_status":"published","publication":"Physical Review Letters","quality_controlled":"1","fulldoi":"https://doi.org/10.1103/PhysRevLett.119.235301","month":"12","article_processing_charge":"No","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:36Z","corr_author":"1","author":[{"orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","last_name":"Yakaboylu","first_name":"Enderalp","full_name":"Yakaboylu, Enderalp"},{"first_name":"Andreas","full_name":"Deuchert, Andreas","last_name":"Deuchert","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746"},{"orcid":"0000-0002-6990-7802","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","full_name":"Lemeshko, Mikhail"}]},{"language":[{"iso":"eng"}],"publication_status":"published","scopus_import":"1","project":[{"grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"}],"isi":1,"publisher":"IEEE","day":"14","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2017-07-26","location":"Honolulu, HA, United States","start_date":"2017-07-21"},"department":[{"_id":"ChLa"},{"_id":"ChWo"}],"page":"5533 - 5542","date_created":"2018-12-11T11:49:37Z","author":[{"last_name":"Rebuffi","full_name":"Rebuffi, Sylvestre Alvise","first_name":"Sylvestre Alvise"},{"last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander","first_name":"Alexander"},{"last_name":"Sperl","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","first_name":"Georg"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"fulldoi":"https://doi.org/10.1109/CVPR.2017.587","quality_controlled":"1","month":"04","article_processing_charge":"No","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","status":"public","date_updated":"2025-06-04T08:18:32Z","_id":"998","doi":"10.1109/CVPR.2017.587","date_published":"2017-04-14T00:00:00Z","volume":2017,"publication_identifier":{"isbn":["978-153860457-1"]},"title":"iCaRL: Incremental classifier and representation learning","oa":1,"publist_id":"6400","abstract":[{"text":"A major open problem on the road to artificial intelligence is the development of incrementally learning systems that learn about more and more concepts over time from a stream of data. In this work, we introduce a new training strategy, iCaRL, that allows learning in such a class-incremental way: only the training data for a small number of classes has to be present at the same time and new classes can be added progressively. iCaRL learns strong classifiers and a data representation simultaneously. This distinguishes it from earlier works that were fundamentally limited to fixed data representations and therefore incompatible with deep learning architectures. We show by experiments on CIFAR-100 and ImageNet ILSVRC 2012 data that iCaRL can learn many classes incrementally over a long period of time where other strategies quickly fail. ","lang":"eng"}],"external_id":{"isi":["000418371405066"],"arxiv":["1611.07725"]},"year":"2017","intvolume":" 2017","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1611.07725","open_access":"1"}],"arxiv":1,"citation":{"ama":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. iCaRL: Incremental classifier and representation learning. In: Vol 2017. IEEE; 2017:5533-5542. doi:10.1109/CVPR.2017.587","mla":"Rebuffi, Sylvestre Alvise, et al. ICaRL: Incremental Classifier and Representation Learning. Vol. 2017, IEEE, 2017, pp. 5533–42, doi:10.1109/CVPR.2017.587.","chicago":"Rebuffi, Sylvestre Alvise, Alexander Kolesnikov, Georg Sperl, and Christoph Lampert. “ICaRL: Incremental Classifier and Representation Learning,” 2017:5533–42. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.587.","short":"S.A. Rebuffi, A. Kolesnikov, G. Sperl, C. Lampert, in:, IEEE, 2017, pp. 5533–5542.","apa":"Rebuffi, S. A., Kolesnikov, A., Sperl, G., & Lampert, C. (2017). iCaRL: Incremental classifier and representation learning (Vol. 2017, pp. 5533–5542). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.587","ieee":"S. A. Rebuffi, A. Kolesnikov, G. Sperl, and C. Lampert, “iCaRL: Incremental classifier and representation learning,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 5533–5542.","ista":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. 2017. iCaRL: Incremental classifier and representation learning. CVPR: Computer Vision and Pattern Recognition vol. 2017, 5533–5542."}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","article_processing_charge":"No","month":"06","quality_controlled":"1","author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina","full_name":"Pentina, Anastasia","first_name":"Anastasia"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph"}],"corr_author":"1","date_created":"2018-12-11T11:49:37Z","page":"2807 - 2816","publisher":"ML Research Press","day":"08","conference":{"location":"Sydney, Australia","start_date":"2017-08-06","end_date":"2017-08-11","name":"ICML: International Conference on Machine Learning"},"department":[{"_id":"ChLa"}],"isi":1,"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}],"scopus_import":"1","publication_status":"published","language":[{"iso":"eng"}],"citation":{"short":"A. Pentina, C. Lampert, in:, ML Research Press, 2017, pp. 2807–2816.","apa":"Pentina, A., & Lampert, C. (2017). Multi-task learning with labeled and unlabeled tasks (Vol. 70, pp. 2807–2816). Presented at the ICML: International Conference on Machine Learning, Sydney, Australia: ML Research Press.","ieee":"A. Pentina and C. Lampert, “Multi-task learning with labeled and unlabeled tasks,” presented at the ICML: International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 2807–2816.","ista":"Pentina A, Lampert C. 2017. Multi-task learning with labeled and unlabeled tasks. ICML: International Conference on Machine Learning, PMLR, vol. 70, 2807–2816.","mla":"Pentina, Anastasia, and Christoph Lampert. Multi-Task Learning with Labeled and Unlabeled Tasks. Vol. 70, ML Research Press, 2017, pp. 2807–16.","ama":"Pentina A, Lampert C. Multi-task learning with labeled and unlabeled tasks. In: Vol 70. ML Research Press; 2017:2807-2816.","chicago":"Pentina, Anastasia, and Christoph Lampert. “Multi-Task Learning with Labeled and Unlabeled Tasks,” 70:2807–16. ML Research Press, 2017."},"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.06518","open_access":"1"}],"alternative_title":["PMLR"],"ec_funded":1,"intvolume":" 70","year":"2017","external_id":{"arxiv":["1602.06518"],"isi":["000683309502093"]},"abstract":[{"lang":"eng","text":"In multi-task learning, a learner is given a collection of prediction tasks and needs to solve all of them. In contrast to previous work, which required that annotated training data must be available for all tasks, we consider a new setting, in which for some tasks, potentially most of them, only unlabeled training data is provided. Consequently, to solve all tasks, information must be transferred between tasks with labels and tasks without labels. Focusing on an instance-based transfer method we analyze two variants of this setting: when the set of labeled tasks is fixed, and when it can be actively selected by the learner. We state and prove a generalization bound that covers both scenarios and derive from it an algorithm for making the choice of labeled tasks (in the active case) and for transferring information between the tasks in a principled way. We also illustrate the effectiveness of the algorithm on synthetic and real data. "}],"publist_id":"6399","oa":1,"title":"Multi-task learning with labeled and unlabeled tasks","publication_identifier":{"isbn":["9781510855144"]},"volume":70,"date_published":"2017-06-08T00:00:00Z","_id":"999","date_updated":"2025-06-04T08:19:03Z","status":"public","type":"conference"},{"date_created":"2018-12-11T11:45:46Z","has_accepted_license":"1","author":[{"last_name":"Camus","first_name":"Nicolas","full_name":"Camus, Nicolas"},{"last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","first_name":"Enderalp","full_name":"Yakaboylu, Enderalp"},{"last_name":"Fechner","first_name":"Lutz","full_name":"Fechner, Lutz"},{"full_name":"Klaiber, Michael","first_name":"Michael","last_name":"Klaiber"},{"first_name":"Martin","full_name":"Laux, Martin","last_name":"Laux"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"last_name":"Hatsagortsyan","first_name":"Karen","full_name":"Hatsagortsyan, Karen"},{"last_name":"Pfeifer","full_name":"Pfeifer, Thomas","first_name":"Thomas"},{"last_name":"Keitel","full_name":"Keitel, Cristoph","first_name":"Cristoph"},{"last_name":"Moshammer","first_name":"Robert","full_name":"Moshammer, Robert"}],"fulldoi":"https://doi.org/10.1088/1742-6596/999/1/012004","month":"07","quality_controlled":"1","article_processing_charge":"No","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["530"],"language":[{"iso":"eng"}],"publication_status":"published","scopus_import":"1","isi":1,"conference":{"name":"Annual International Laser Physics Workshop LPHYS","start_date":"2017-08-17","location":"Kazan, Russian Federation","end_date":"2017-08-21"},"department":[{"_id":"MiLe"}],"day":"14","publisher":"American Physical Society","year":"2017","intvolume":" 999","file":[{"date_updated":"2020-07-14T12:46:00Z","access_level":"open_access","date_created":"2019-01-22T08:34:10Z","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","file_id":"5871","file_name":"2017_Physics_Camus.pdf","creator":"dernst","file_size":949321,"content_type":"application/pdf","relation":"main_file"}],"alternative_title":["Journal of Physics: Conference Series"],"arxiv":1,"citation":{"mla":"Camus, Nicolas, et al. Experimental Evidence for Wigner’s Tunneling Time. Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:10.1088/1742-6596/999/1/012004.","ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s tunneling time. In: Vol 999. American Physical Society; 2017. doi:10.1088/1742-6596/999/1/012004","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American Physical Society, 2017. https://doi.org/10.1088/1742-6596/999/1/012004.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan, T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017.","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K, Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference Series, vol. 999, 012004.","ieee":"N. Camus et al., “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004"},"related_material":{"record":[{"relation":"later_version","id":"6013","status":"public"}]},"status":"public","type":"conference","date_updated":"2025-09-18T10:29:07Z","_id":"313","doi":"10.1088/1742-6596/999/1/012004","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_published":"2017-07-14T00:00:00Z","article_number":"012004","issue":"1","volume":999,"file_date_updated":"2020-07-14T12:46:00Z","title":"Experimental evidence for Wigner's tunneling time","publication_identifier":{"issn":["1742-6588"]},"oa":1,"publist_id":"7552","abstract":[{"lang":"eng","text":"Tunneling of a particle through a potential barrier remains one of the most remarkable quantum phenomena. Owing to advances in laser technology, electric fields comparable to those electrons experience in atoms are readily generated and open opportunities to dynamically investigate the process of electron tunneling through the potential barrier formed by the superposition of both laser and atomic fields. Attosecond-time and angstrom-space resolution of the strong laser-field technique allow to address fundamental questions related to tunneling, which are still open and debated: Which time is spent under the barrier and what momentum is picked up by the particle in the meantime? In this combined experimental and theoretical study we demonstrate that for strong-field ionization the leading quantum mechanical Wigner treatment for the time resolved description of tunneling is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously isolate its effects by performing a differential study of two systems with almost identical tunneling geometry. Moreover, working with a low frequency laser, we essentially limit the non-adiabaticity of the process as a major source of uncertainty. The agreement between experiment and theory implies two substantial corrections with respect to the widely employed quasiclassical treatment: In addition to a non-vanishing longitudinal momentum along the laser field-direction we provide clear evidence for a non-zero tunneling time delay. This addresses also the fundamental question how the transition occurs from the tunnel barrier to free space classical evolution of the ejected electron."}],"external_id":{"arxiv":["1611.03701"],"isi":["000432427200004"]}},{"month":"10","fulldoi":"https://doi.org/10.1007/978-3-319-44479-6_17","quality_controlled":"1","oa_version":"Published Version","article_processing_charge":"No","editor":[{"full_name":"Loebl, Martin","first_name":"Martin","last_name":"Loebl"},{"last_name":"Nešetřil","first_name":"Jaroslav","full_name":"Nešetřil, Jaroslav"},{"last_name":"Thomas","first_name":"Robin","full_name":"Thomas, Robin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:24Z","page":"407 - 447","author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"full_name":"Paták, Pavel","first_name":"Pavel","last_name":"Paták"},{"orcid":"0000-0002-3975-1683","last_name":"Patakova","full_name":"Patakova, Zuzana","first_name":"Zuzana"},{"last_name":"Tancer","orcid":"0000-0002-1191-6714","first_name":"Martin","full_name":"Tancer, Martin"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli"}],"scopus_import":"1","publisher":"Springer","department":[{"_id":"UlWa"}],"day":"06","publication_status":"published","language":[{"iso":"eng"}],"ddc":["500"],"publication":"A Journey through Discrete Mathematics: A Tribute to Jiri Matousek","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.4613"}],"arxiv":1,"citation":{"chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers.” In A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nešetřil, and Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-44479-6_17.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics. Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17","mla":"Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017, pp. 407–447.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447."},"year":"2017","oa":1,"series_title":"A Journey Through Discrete Mathematics","title":"Bounding helly numbers via betti numbers","publication_identifier":{"isbn":["978-331944479-6"]},"publist_id":"7399","external_id":{"arxiv":["1310.4613"]},"abstract":[{"text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤ i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced Z2-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these [d/2] first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map C*(K)→C*(Rd).","lang":"eng"}],"date_updated":"2026-06-18T18:48:49Z","status":"public","type":"book_chapter","related_material":{"record":[{"status":"public","id":"1512","relation":"earlier_version"}]},"date_published":"2017-10-06T00:00:00Z","doi":"10.1007/978-3-319-44479-6_17","_id":"424"},{"abstract":[{"lang":"eng","text":"Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to its excellent scalability properties. A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating gradient updates between nodes; consequently, several lossy compresion heuristics have been proposed, by which nodes only communicate quantized gradients. Although effective in practice, these heuristics do not always converge. In this paper, we propose Quantized SGD (QSGD), a family of compression schemes with convergence guarantees and good practical performance. QSGD allows the user to smoothly trade off communication bandwidth and convergence time: nodes can adjust the number of bits sent per iteration, at the cost of possibly higher variance. We show that this trade-off is inherent, in the sense that improving it past some threshold would violate information-theoretic lower bounds. QSGD guarantees convergence for convex and non-convex objectives, under asynchrony, and can be extended to stochastic variance-reduced techniques. When applied to training deep neural networks for image classification and automated speech recognition, QSGD leads to significant reductions in end-to-end training time. For instance, on 16GPUs, we can train the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision variant. "}],"external_id":{"arxiv":["1610.02132"],"isi":["000452649401072"]},"publication_identifier":{"issn":["1049-5258"]},"title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","oa":1,"publist_id":"7392","volume":2017,"status":"public","type":"conference","date_updated":"2025-09-18T10:07:20Z","_id":"431","date_published":"2017-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.02132"}],"arxiv":1,"citation":{"chicago":"Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,” 2017:1710–21. Neural Information Processing Systems Foundation, 2017.","mla":"Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding. Vol. 2017, Neural Information Processing Systems Foundation, 2017, pp. 1710–21.","ama":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing Systems Foundation; 2017:1710-1721.","apa":"Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., & Vojnović, M. (2017). QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol. 2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States: Neural Information Processing Systems Foundation.","ista":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient SGD via gradient quantization and encoding. NIPS: Neural Information Processing System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.","ieee":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.","short":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information Processing Systems Foundation, 2017, pp. 1710–1721."},"intvolume":" 2017","alternative_title":["Advances in Neural Information Processing Systems"],"year":"2017","day":"01","conference":{"name":"NIPS: Neural Information Processing System","end_date":"2017-12-09","start_date":"2017-12-04","location":"Long Beach, CA, United States"},"department":[{"_id":"DaAl"}],"publisher":"Neural Information Processing Systems Foundation","isi":1,"language":[{"iso":"eng"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","month":"01","article_processing_charge":"No","oa_version":"Submitted Version","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"first_name":"Demjan","full_name":"Grubic, Demjan","last_name":"Grubic"},{"first_name":"Jerry","full_name":"Li, Jerry","last_name":"Li"},{"full_name":"Tomioka, Ryota","first_name":"Ryota","last_name":"Tomioka"},{"first_name":"Milan","full_name":"Vojnović, Milan","last_name":"Vojnović"}],"date_created":"2018-12-11T11:46:26Z","page":"1710-1721","corr_author":"1"},{"publication_status":"published","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of Machine Learning Research","isi":1,"scopus_import":"1","conference":{"end_date":"2017-08-11","location":"Sydney, Australia","start_date":"2017-08-06","name":"ICML: International Conference on Machine Learning"},"day":"01","publisher":"ML Research Press","department":[{"_id":"DaAl"}],"corr_author":"1","page":"4035 - 4043","date_created":"2018-12-11T11:46:26Z","author":[{"first_name":"Hantian","full_name":"Zhang, Hantian","last_name":"Zhang"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"},{"last_name":"Kara","full_name":"Kara, Kaan","first_name":"Kaan"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Ji","full_name":"Liu, Ji","last_name":"Liu"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"}],"has_accepted_license":"1","oa_version":"Submitted Version","article_processing_charge":"No","month":"01","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2017-01-01T00:00:00Z","_id":"432","date_updated":"2025-09-18T10:06:02Z","status":"public","type":"conference","volume":" 70","publist_id":"7391","oa":1,"title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","file_date_updated":"2020-07-14T12:46:26Z","publication_identifier":{"isbn":["978-151085514-4"]},"external_id":{"isi":["000683309504015"]},"abstract":[{"lang":"eng","text":"Recently there has been significant interest in training machine-learning models at low precision: by reducing precision, one can reduce computation and communication by one order of magnitude. We examine training at reduced precision, both from a theoretical and practical perspective, and ask: is it possible to train models at end-to-end low precision with provable guarantees? Can this lead to consistent order-of-magnitude speedups? We mainly focus on linear models, and the answer is yes for linear models. We develop a simple framework called ZipML based on one simple but novel strategy called double sampling. Our ZipML framework is able to execute training at low precision with no bias, guaranteeing convergence, whereas naive quanti- zation would introduce significant bias. We val- idate our framework across a range of applica- tions, and show that it enables an FPGA proto- type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision. We further de- velop a variance-optimal stochastic quantization strategy and show that it can make a significant difference in a variety of settings. When applied to linear models together with double sampling, we save up to another 1.7 × in data movement compared with uniform quantization. When training deep networks with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. "}],"year":"2017","file":[{"date_created":"2019-01-22T08:23:58Z","access_level":"open_access","date_updated":"2020-07-14T12:46:26Z","file_name":"2017_ICML_Zhang.pdf","file_id":"5869","checksum":"86156ba7f4318e47cef3eb9092593c10","file_size":849345,"relation":"main_file","content_type":"application/pdf","creator":"dernst"}],"alternative_title":["PMLR Press"],"citation":{"apa":"Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., & Zhang, C. (2017). ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In Proceedings of Machine Learning Research (Vol. 70, pp. 4035–4043). Sydney, Australia: ML Research Press.","ista":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. Proceedings of Machine Learning Research. ICML: International Conference on Machine Learning, PMLR Press, vol. 70, 4035–4043.","ieee":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.","short":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.","chicago":"Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In Proceedings of Machine Learning Research, 70:4035–43. ML Research Press, 2017.","ama":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: Proceedings of Machine Learning Research. Vol 70. ML Research Press; 2017:4035-4043.","mla":"Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning Research, vol. 70, ML Research Press, 2017, pp. 4035–43."}},{"extern":"1","intvolume":" 31","citation":{"apa":"Litany, O., Remez, T., Rodola, E., Bronstein, A., & Bronstein, M. (2017). Deep functional maps: Structured prediction for dense shape correspondence. In 2017 IEEE International Conference on Computer Vision (ICCV) (Vol. 31). IEEE. https://doi.org/10.1109/iccv.2017.603","ista":"Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. 2017. Deep functional maps: Structured prediction for dense shape correspondence. 2017 IEEE International Conference on Computer Vision (ICCV). 16th IEEE International Conference on Computer Vision vol. 31, 8237865.","ieee":"O. Litany, T. Remez, E. Rodola, A. Bronstein, and M. Bronstein, “Deep functional maps: Structured prediction for dense shape correspondence,” in 2017 IEEE International Conference on Computer Vision (ICCV), 2017, vol. 31.","short":"O. Litany, T. Remez, E. Rodola, A. Bronstein, M. Bronstein, in:, 2017 IEEE International Conference on Computer Vision (ICCV), IEEE, 2017.","chicago":"Litany, Or, Tal Remez, Emanuele Rodola, Alexander Bronstein, and Michael Bronstein. “Deep Functional Maps: Structured Prediction for Dense Shape Correspondence.” In 2017 IEEE International Conference on Computer Vision (ICCV), Vol. 31. IEEE, 2017. https://doi.org/10.1109/iccv.2017.603.","mla":"Litany, Or, et al. “Deep Functional Maps: Structured Prediction for Dense Shape Correspondence.” 2017 IEEE International Conference on Computer Vision (ICCV), vol. 31, 8237865, IEEE, 2017, doi:10.1109/iccv.2017.603.","ama":"Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. Deep functional maps: Structured prediction for dense shape correspondence. In: 2017 IEEE International Conference on Computer Vision (ICCV). Vol 31. IEEE; 2017. doi:10.1109/iccv.2017.603"},"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1704.08686"}],"year":"2017","oa":1,"publication_identifier":{"eissn":["9781538610329"]},"title":"Deep functional maps: Structured prediction for dense shape correspondence","external_id":{"arxiv":["1704.08686"]},"abstract":[{"text":"We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existing learning based approaches model shape correspondence as a labelling problem, where each point of a query shape receives a label identifying a point on some reference domain; the correspondence is then constructed a posteriori by composing the label predictions of two input shapes. We propose a paradigm shift and design a structured prediction model in the space of functional maps, linear operators that provide a compact representation of the correspondence. We model the learning process via a deep residual network which takes dense descriptor fields defined on two shapes as input, and outputs a soft map between the two given objects. The resulting correspondence is shown to be accurate on several challenging benchmarks comprising multiple categories, synthetic models, real scans with acquisition artifacts, topological noise, and partiality.","lang":"eng"}],"doi":"10.1109/iccv.2017.603","date_published":"2017-12-25T00:00:00Z","_id":"18286","date_updated":"2024-12-05T14:20:54Z","status":"public","type":"conference","volume":31,"article_number":"8237865","oa_version":"Preprint","article_processing_charge":"No","month":"12","fulldoi":"https://doi.org/10.1109/iccv.2017.603","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-09T07:48:43Z","author":[{"last_name":"Litany","first_name":"Or","full_name":"Litany, Or"},{"first_name":"Tal","full_name":"Remez, Tal","last_name":"Remez"},{"full_name":"Rodola, Emanuele","first_name":"Emanuele","last_name":"Rodola"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","last_name":"Bronstein"},{"first_name":"Michael","full_name":"Bronstein, Michael","last_name":"Bronstein"}],"scopus_import":"1","conference":{"end_date":"2017-10-29","start_date":"2017-10-22","name":"16th IEEE International Conference on Computer Vision"},"publisher":"IEEE","department":[{"_id":"E-Lib"}],"day":"25","publication_status":"published","language":[{"iso":"eng"}],"publication":"2017 IEEE International Conference on Computer Vision (ICCV)"}]