[{"article_processing_charge":"No","abstract":[{"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)","lang":"eng"}],"_id":"9859","year":"2017","related_material":{"record":[{"relation":"used_in_publication","id":"1006","status":"public"}]},"title":"Additional file 1: Table S1. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","status":"public","date_published":"2017-04-26T00:00:00Z","publisher":"Springer Nature","oa_version":"Published Version","date_updated":"2025-07-10T11:49:39Z","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 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","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","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.","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."},"oa":1,"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"}],"author":[{"first_name":"Jenny","last_name":"Greenwood","full_name":"Greenwood, Jenny"},{"first_name":"Barbara","orcid":"0000-0002-8214-4758","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara","last_name":"Milutinovic"},{"first_name":"Robert","full_name":"Peuß, Robert","last_name":"Peuß"},{"first_name":"Sarah","full_name":"Behrens, Sarah","last_name":"Behrens"},{"last_name":"Essar","full_name":"Essar, Daniela","first_name":"Daniela"},{"first_name":"Philip","last_name":"Rosenstiel","full_name":"Rosenstiel, Philip"},{"first_name":"Hinrich","full_name":"Schulenburg, Hinrich","last_name":"Schulenburg"},{"full_name":"Kurtz, Joachim","last_name":"Kurtz","first_name":"Joachim"}],"department":[{"_id":"SyCr"}],"day":"26","doi":"10.6084/m9.figshare.c.3756974_d1.v1","month":"04","date_created":"2021-08-10T07:59:02Z","type":"research_data_reference"},{"oa_version":"Published Version","publisher":"Springer Nature","date_published":"2017-04-26T00:00:00Z","status":"public","title":"Additional file 5: Table S3. of Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","year":"2017","related_material":{"record":[{"relation":"used_in_publication","id":"1006","status":"public"}]},"_id":"9860","article_processing_charge":"No","type":"research_data_reference","date_created":"2021-08-10T08:07:12Z","doi":"10.6084/m9.figshare.c.3756974_d5.v1","month":"04","day":"26","department":[{"_id":"SyCr"}],"author":[{"first_name":"Jenny","full_name":"Greenwood, Jenny","last_name":"Greenwood"},{"full_name":"Milutinovic, Barbara","last_name":"Milutinovic","first_name":"Barbara","orcid":"0000-0002-8214-4758","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","last_name":"Peuß","full_name":"Peuß, Robert"},{"last_name":"Behrens","full_name":"Behrens, Sarah","first_name":"Sarah"},{"last_name":"Essar","full_name":"Essar, Daniela","first_name":"Daniela"},{"first_name":"Philip","full_name":"Rosenstiel, Philip","last_name":"Rosenstiel"},{"first_name":"Hinrich","full_name":"Schulenburg, Hinrich","last_name":"Schulenburg"},{"last_name":"Kurtz","full_name":"Kurtz, Joachim","first_name":"Joachim"}],"main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.c.3756974_d5.v1","open_access":"1"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"citation":{"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.","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","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.","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","short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, (2017)."},"date_updated":"2025-07-10T11:49:39Z"},{"oa_version":"Published Version","date_published":"2017-02-14T00:00:00Z","publisher":"Dryad","title":"Data from: X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster","status":"public","related_material":{"record":[{"status":"public","id":"1019","relation":"used_in_publication"}]},"year":"2017","abstract":[{"lang":"eng","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."}],"_id":"9861","article_processing_charge":"No","type":"research_data_reference","date_created":"2021-08-10T08:12:52Z","month":"02","doi":"10.5061/dryad.02f6r","department":[{"_id":"BeVi"}],"day":"14","author":[{"full_name":"Argyridou, Eliza","last_name":"Argyridou","first_name":"Eliza"},{"full_name":"Huylmans, Ann K","last_name":"Huylmans","first_name":"Ann K","orcid":"0000-0001-8871-4961","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Königer","full_name":"Königer, Annabella","first_name":"Annabella"},{"last_name":"Parsch","full_name":"Parsch, John","first_name":"John"}],"date_updated":"2025-07-10T11:49:45Z","citation":{"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","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","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.","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.","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."},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.02f6r","open_access":"1"}],"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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.","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","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.","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.","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."},"oa":1,"date_updated":"2025-07-10T12:02:04Z","scopus_import":"1","pubrep_id":"826","department":[{"_id":"NanoFab"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:48:18Z","date_created":"2018-12-11T11:49:33Z","issue":"6","publist_id":"6412","_id":"988","title":"Current-phase relation of ballistic graphene Josephson junctions","publisher":"American Chemical Society","date_published":"2017-05-05T00:00:00Z","file":[{"date_created":"2018-12-12T10:13:50Z","relation":"main_file","file_id":"5037","access_level":"open_access","creator":"system","file_size":508638,"content_type":"application/pdf","checksum":"22021daa90cf13b01becd776838acb7b","date_updated":"2020-07-14T12:48:18Z","file_name":"IST-2017-826-v1+1_2017_Aguilera-Servin_Current.pdf"}],"oa_version":"Published Version","publication_identifier":{"issn":["1530-6984"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"author":[{"first_name":"Gaurav","last_name":"Nanda","full_name":"Nanda, Gaurav"},{"last_name":"Aguilera Servin","full_name":"Aguilera Servin, Juan L","id":"2A67C376-F248-11E8-B48F-1D18A9856A87","first_name":"Juan L","orcid":"0000-0002-2862-8372"},{"first_name":"Péter","last_name":"Rakyta","full_name":"Rakyta, Péter"},{"first_name":"Andor","last_name":"Kormányos","full_name":"Kormányos, Andor"},{"first_name":"Reinhold","full_name":"Kleiner, Reinhold","last_name":"Kleiner"},{"last_name":"Koelle","full_name":"Koelle, Dieter","first_name":"Dieter"},{"first_name":"Kazuo","full_name":"Watanabe, Kazuo","last_name":"Watanabe"},{"full_name":"Taniguchi, Takashi","last_name":"Taniguchi","first_name":"Takashi"},{"full_name":"Vandersypen, Lieven","last_name":"Vandersypen","first_name":"Lieven"},{"first_name":"Srijit","last_name":"Goswami","full_name":"Goswami, Srijit"}],"intvolume":" 17","volume":17,"day":"05","month":"05","doi":"10.1021/acs.nanolett.7b00097","has_accepted_license":"1","isi":1,"publication_status":"published","type":"journal_article","article_processing_charge":"No","external_id":{"isi":["000403631600011"]},"publication":"Nano Letters","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"}],"year":"2017","ddc":["621"],"page":"3396 - 3401","language":[{"iso":"eng"}],"status":"public"},{"language":[{"iso":"eng"}],"page":"563 - 577","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"last_name":"Dong","full_name":"Dong, Yiqiu","first_name":"Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl","first_name":"Anders"}],"year":"2017","abstract":[{"lang":"eng","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."}],"external_id":{"isi":["000432210900045"]},"article_processing_charge":"No","status":"public","day":"18","intvolume":" 10302","volume":10302,"author":[{"orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan"},{"full_name":"Rumpf, Martin","last_name":"Rumpf","first_name":"Martin"},{"first_name":"Stefan","full_name":"Simon, Stefan","last_name":"Simon"}],"publication_identifier":{"issn":["0302-9743"]},"type":"conference","isi":1,"publication_status":"published","month":"05","doi":"10.1007/978-3-319-58771-4_45","_id":"989","publist_id":"6410","oa_version":"None","date_published":"2017-05-18T00:00:00Z","publisher":"Springer","title":"Transport based image morphing with intensity modulation","conference":{"location":"Kolding, Denmark","end_date":"2017-06-08","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"department":[{"_id":"JaMa"}],"alternative_title":["LNCS"],"date_updated":"2026-04-16T10:05:10Z","scopus_import":"1","citation":{"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.","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.","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.","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.","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."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2018-12-11T11:49:34Z","quality_controlled":"1"},{"ec_funded":1,"status":"public","article_processing_charge":"No","publication":"Evolution; International Journal of Organic Evolution","external_id":{"isi":["000403014800005"],"pmid":["28419447"]},"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"}],"year":"2017","page":"1478 - 1493 ","ddc":["576"],"language":[{"iso":"eng"}],"doi":"10.1111/evo.13252","month":"06","publication_status":"published","isi":1,"has_accepted_license":"1","type":"journal_article","publication_identifier":{"issn":["0014-3820"]},"volume":71,"author":[{"last_name":"Sachdeva","full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"}],"intvolume":" 71","day":"01","corr_author":"1","title":"Divergence and evolution of assortative mating in a polygenic trait model of speciation with gene flow","publisher":"Wiley-Blackwell","file":[{"file_size":625260,"content_type":"application/pdf","checksum":"6d4c38cb1347fd43620d1736c6df5c79","date_updated":"2020-07-14T12:48:18Z","file_name":"2017_Evolution_Sachdeva_supplement.pdf","date_created":"2019-04-17T07:37:04Z","relation":"main_file","file_id":"6329","access_level":"open_access","creator":"dernst"},{"creator":"dernst","access_level":"open_access","file_id":"6330","relation":"main_file","date_created":"2019-04-17T07:37:04Z","file_name":"2017_Evolution_Sachdeva_article.pdf","date_updated":"2020-07-14T12:48:18Z","checksum":"f1d90dd8831b44baf49b4dd176f263af","content_type":"application/pdf","file_size":520110}],"date_published":"2017-06-01T00:00:00Z","oa_version":"Submitted Version","publist_id":"6409","_id":"990","quality_controlled":"1","file_date_updated":"2020-07-14T12:48:18Z","date_created":"2018-12-11T11:49:34Z","issue":"6","pmid":1,"oa":1,"citation":{"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.","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.","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.","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","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.","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","short":"H. Sachdeva, N.H. Barton, Evolution; International Journal of Organic Evolution 71 (2017) 1478–1493."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-07-10T12:02:04Z","pubrep_id":"977","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"department":[{"_id":"NiBa"}]},{"status":"public","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."}],"article_processing_charge":"No","publication":"Neuron","external_id":{"isi":["000401415100002"]},"page":"694 - 696","language":[{"iso":"eng"}],"year":"2017","month":"05","doi":"10.1016/j.neuron.2017.05.011","isi":1,"publication_status":"published","type":"journal_article","publication_identifier":{"issn":["0896-6273"]},"day":"17","intvolume":" 94","volume":94,"author":[{"id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","first_name":"Chong","full_name":"Chen, Chong","last_name":"Chen"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"title":"Synaptotagmins: That’s why so many","oa_version":"None","publisher":"Elsevier","date_published":"2017-05-17T00:00:00Z","_id":"991","publist_id":"6408","quality_controlled":"1","issue":"4","date_created":"2018-12-11T11:49:34Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"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","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.","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.","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.","ieee":"C. Chen and P. M. Jonas, “Synaptotagmins: That’s why so many,” Neuron, vol. 94, no. 4. Elsevier, pp. 694–696, 2017."},"date_updated":"2026-04-16T10:05:51Z","scopus_import":"1","department":[{"_id":"PeJo"}]},{"status":"public","ec_funded":1,"abstract":[{"lang":"eng","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)."}],"article_processing_charge":"No","ddc":["004"],"page":"97","language":[{"iso":"eng"}],"year":"2017","doi":"10.15479/AT:ISTA:th_815","month":"05","publication_status":"published","has_accepted_license":"1","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","day":"01","corr_author":"1","author":[{"full_name":"Rolinek, Michal","last_name":"Rolinek","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"title":"Complexity of constraint satisfaction","supervisor":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"oa_version":"Published Version","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","publisher":"Institute of Science and Technology Austria","date_published":"2017-05-01T00:00:00Z","file":[{"date_updated":"2020-07-14T12:48:18Z","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","file_size":786145,"content_type":"application/pdf","checksum":"81761fb939acb7585c36629f765b4373","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:07:55Z","file_id":"4654","relation":"main_file"},{"date_created":"2019-04-05T08:43:24Z","file_id":"6208","relation":"source_file","access_level":"closed","creator":"dernst","file_size":5936337,"checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","content_type":"application/zip","date_updated":"2020-07-14T12:48:18Z","file_name":"2017_Thesis_Rolinek_source.zip"}],"_id":"992","publist_id":"6407","file_date_updated":"2020-07-14T12:48:18Z","date_created":"2018-12-11T11:49:35Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"citation":{"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.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815","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.","mla":"Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.","chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815."},"date_updated":"2026-04-08T14:17:06Z","alternative_title":["ISTA Thesis"],"OA_place":"publisher","department":[{"_id":"VlKo"}],"project":[{"call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"pubrep_id":"815"},{"ec_funded":1,"status":"public","publication":"Nature Communications","external_id":{"isi":["000400560700001"]},"article_processing_charge":"Yes (in subscription journal)","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"}],"article_number":"15140","year":"2017","language":[{"iso":"eng"}],"ddc":["005","571"],"month":"05","doi":"10.1038/ncomms15140","type":"journal_article","has_accepted_license":"1","publication_status":"published","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["2041-1723"]},"volume":8,"intvolume":" 8","author":[{"last_name":"Levina (Martius)","full_name":"Levina (Martius), Anna","id":"35AF8020-F248-11E8-B48F-1D18A9856A87","first_name":"Anna"},{"last_name":"Priesemann","full_name":"Priesemann, Viola","first_name":"Viola"}],"day":"04","title":"Subsampling scaling","date_published":"2017-05-04T00:00:00Z","file":[{"date_created":"2018-12-12T10:15:05Z","relation":"main_file","file_id":"5122","access_level":"open_access","creator":"system","file_size":746224,"checksum":"9880212f8c4c53404c7c6fbf9023c53a","content_type":"application/pdf","date_updated":"2020-07-14T12:48:19Z","file_name":"IST-2017-819-v1+1_2017_Levina_SubsamplingScaling.pdf"}],"publisher":"Nature Publishing Group","oa_version":"Published Version","publist_id":"6406","_id":"993","quality_controlled":"1","file_date_updated":"2020-07-14T12:48:19Z","date_created":"2018-12-11T11:49:35Z","date_updated":"2025-07-10T12:02:06Z","scopus_import":"1","oa":1,"citation":{"ieee":"A. Levina (Martius) and V. Priesemann, “Subsampling scaling,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","mla":"Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature Communications, vol. 8, 15140, Nature Publishing Group, 2017, 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.","apa":"Levina (Martius), A., & Priesemann, V. (2017). Subsampling scaling. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms15140","short":"A. Levina (Martius), V. Priesemann, Nature Communications 8 (2017).","ama":"Levina (Martius) A, Priesemann V. Subsampling scaling. Nature Communications. 2017;8. doi:10.1038/ncomms15140","ista":"Levina (Martius) A, Priesemann V. 2017. Subsampling scaling. Nature Communications. 8, 15140."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"819","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"department":[{"_id":"GaTk"},{"_id":"JoCs"}]},{"publisher":"American Physical Society","date_published":"2017-08-08T00:00:00Z","oa_version":"Submitted Version","title":"Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules","publist_id":"6405","_id":"994","date_created":"2018-12-11T11:49:35Z","arxiv":1,"issue":"3","quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"MiLe"}],"citation":{"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","ista":"Cherepanov I, Lemeshko M. 2017. Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. Physical Review Materials. 1(3).","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","short":"I. Cherepanov, M. Lemeshko, Physical Review Materials 1 (2017).","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.","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."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1705.09220","open_access":"1"}],"date_updated":"2025-06-04T10:15:04Z","scopus_import":"1","ec_funded":1,"status":"public","year":"2017","language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Physical Review Materials","external_id":{"isi":["000416564000004"],"arxiv":["1705.09220"]},"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."}],"isi":1,"publication_status":"published","type":"journal_article","doi":"10.1103/PhysRevMaterials.1.035602","month":"08","volume":1,"author":[{"id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","last_name":"Cherepanov","full_name":"Cherepanov, Igor"},{"full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"intvolume":" 1","day":"08","corr_author":"1"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02616"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Bighin G, Lemeshko M. Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. Physical Review B - Condensed Matter and Materials Physics. 2017;96(8). doi:10.1103/PhysRevB.96.085410","ista":"Bighin G, Lemeshko M. 2017. Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. Physical Review B - Condensed Matter and Materials Physics. 96(8), 085410.","apa":"Bighin, G., & Lemeshko, M. (2017). Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.085410","short":"G. Bighin, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","mla":"Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital Quantum Impurities Interacting with a Many-Particle Environment.” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 8, 085410, American Physical Society, 2017, doi:10.1103/PhysRevB.96.085410.","chicago":"Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital Quantum Impurities Interacting with a Many-Particle Environment.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.085410.","ieee":"G. Bighin and M. Lemeshko, “Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment,” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 8. American Physical Society, 2017."},"oa":1,"date_updated":"2025-06-04T08:17:18Z","scopus_import":"1","department":[{"_id":"MiLe"}],"project":[{"call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","arxiv":1,"date_created":"2018-12-11T11:49:36Z","issue":"8","publist_id":"6404","_id":"995","title":"Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment","publisher":"American Physical Society","date_published":"2017-08-07T00:00:00Z","oa_version":"Submitted Version","publication_identifier":{"issn":["2469-9950"]},"author":[{"last_name":"Bighin","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","orcid":"0000-0001-8823-9777"},{"orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"}],"intvolume":" 96","volume":96,"day":"07","corr_author":"1","doi":"10.1103/PhysRevB.96.085410","month":"08","publication_status":"published","isi":1,"type":"journal_article","article_processing_charge":"No","external_id":{"arxiv":["1704.02616"],"isi":["000407017100009"]},"publication":"Physical Review B - Condensed Matter and Materials Physics","article_number":"085410","abstract":[{"lang":"eng","text":"Recently it was shown that an impurity exchanging orbital angular momentum with a surrounding bath can be described in terms of the angulon quasiparticle [Phys. Rev. Lett. 118, 095301 (2017)]. The angulon consists of a quantum rotor dressed by a many-particle field of boson excitations, and can be formed out of, for example, a molecule or a nonspherical atom in superfluid helium, or out of an electron coupled to lattice phonons or a Bose condensate. Here we develop an approach to the angulon based on the path-integral formalism, which sets the ground for a systematic, perturbative treatment of the angulon problem. The resulting perturbation series can be interpreted in terms of Feynman diagrams, from which, in turn, one can derive a set of diagrammatic rules. These rules extend the machinery of the graphical theory of angular momentum - well known from theoretical atomic spectroscopy - to the case where an environment with an infinite number of degrees of freedom is present. In particular, we show that each diagram can be interpreted as a 'skeleton', which enforces angular momentum conservation, dressed by an additional many-body contribution. This connection between the angulon theory and the graphical theory of angular momentum is particularly important as it allows to systematically and substantially simplify the analytical representation of each diagram. In order to exemplify the technique, we calculate the 1- and 2-loop contributions to the angulon self-energy, the spectral function, and the quasiparticle weight. The diagrammatic theory we develop paves the way to investigate next-to-leading order quantities in a more compact way compared to the variational approaches."}],"year":"2017","language":[{"iso":"eng"}],"status":"public"},{"title":"Strongly aligned molecules inside helium droplets in the near-adiabatic regime","oa_version":"Submitted Version","date_published":"2017-06-01T00:00:00Z","publisher":"AIP Publishing","_id":"996","publist_id":"6403","quality_controlled":"1","issue":"1","arxiv":1,"date_created":"2018-12-11T11:49:36Z","date_updated":"2025-06-04T08:17:46Z","scopus_import":"1","citation":{"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","short":"B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko, H. Stapelfeldt, The Journal of Chemical Physics 147 (2017).","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","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.","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.","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."},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1704.03684","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"status":"public","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. "}],"article_number":"013946","publication":"The Journal of Chemical Physics","external_id":{"arxiv":["1704.03684"],"isi":["000405089400047"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","month":"06","doi":"10.1063/1.4983703","type":"journal_article","isi":1,"publication_status":"published","publication_identifier":{"issn":["0021-9606"]},"day":"01","intvolume":" 147","volume":147,"author":[{"last_name":"Shepperson","full_name":"Shepperson, Benjamin","first_name":"Benjamin"},{"first_name":"Adam","last_name":"Chatterley","full_name":"Chatterley, Adam"},{"last_name":"Søndergaard","full_name":"Søndergaard, Anders","first_name":"Anders"},{"full_name":"Christiansen, Lars","last_name":"Christiansen","first_name":"Lars"},{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik","first_name":"Henrik"}]},{"type":"journal_article","isi":1,"publication_status":"published","article_type":"original","month":"12","doi":"10.1103/PhysRevLett.119.235301","corr_author":"1","day":"06","intvolume":" 119","volume":119,"author":[{"full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","first_name":"Enderalp"},{"first_name":"Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","last_name":"Deuchert"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"}],"publication_identifier":{"issn":["0031-9007"]},"status":"public","ec_funded":1,"language":[{"iso":"eng"}],"year":"2017","abstract":[{"lang":"eng","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."}],"article_number":"235301","external_id":{"isi":["000417132100007"],"arxiv":["1705.05162"]},"publication":"Physical Review Letters","article_processing_charge":"No","issue":"23","arxiv":1,"date_created":"2018-12-11T11:49:36Z","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"}],"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"scopus_import":"1","date_updated":"2025-04-14T07:26:54Z","citation":{"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.","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.","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","short":"E. Yakaboylu, A. Deuchert, M. Lemeshko, Physical Review Letters 119 (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.","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.05162","open_access":"1"}],"oa_version":"Preprint","date_published":"2017-12-06T00:00:00Z","publisher":"American Physical Society","title":"Emergence of non-abelian magnetic monopoles in a quantum impurity problem","_id":"997","publist_id":"6401"},{"article_processing_charge":"No","external_id":{"arxiv":["1611.07725"],"isi":["000418371405066"]},"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"}],"year":"2017","page":"5533 - 5542","language":[{"iso":"eng"}],"ec_funded":1,"status":"public","publication_identifier":{"isbn":["978-153860457-1"]},"volume":2017,"author":[{"last_name":"Rebuffi","full_name":"Rebuffi, Sylvestre Alvise","first_name":"Sylvestre Alvise"},{"last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander"},{"last_name":"Sperl","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"intvolume":" 2017","day":"14","doi":"10.1109/CVPR.2017.587","month":"04","publication_status":"published","isi":1,"type":"conference","publist_id":"6400","_id":"998","conference":{"start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition","location":"Honolulu, HA, United States","end_date":"2017-07-26"},"title":"iCaRL: Incremental classifier and representation learning","publisher":"IEEE","date_published":"2017-04-14T00:00:00Z","oa_version":"Submitted Version","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.07725"}],"citation":{"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","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.","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-06-04T08:18:32Z","department":[{"_id":"ChLa"},{"_id":"ChWo"}],"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"quality_controlled":"1","date_created":"2018-12-11T11:49:37Z","arxiv":1},{"volume":70,"author":[{"full_name":"Pentina, Anastasia","last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia"},{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"intvolume":" 70","corr_author":"1","day":"08","publication_identifier":{"isbn":["9781510855144"]},"type":"conference","publication_status":"published","isi":1,"month":"06","year":"2017","language":[{"iso":"eng"}],"page":"2807 - 2816","external_id":{"arxiv":["1602.06518"],"isi":["000683309502093"]},"article_processing_charge":"No","abstract":[{"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. ","lang":"eng"}],"ec_funded":1,"status":"public","project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"ChLa"}],"scopus_import":"1","date_updated":"2025-06-04T08:19:03Z","alternative_title":["PMLR"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.06518"}],"citation":{"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.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2017, pp. 2807–2816.","ama":"Pentina A, Lampert C. Multi-task learning with labeled and unlabeled tasks. In: Vol 70. ML Research Press; 2017: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.","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.","mla":"Pentina, Anastasia, and Christoph Lampert. Multi-Task Learning with Labeled and Unlabeled Tasks. Vol. 70, ML Research Press, 2017, pp. 2807–16.","chicago":"Pentina, Anastasia, and Christoph Lampert. “Multi-Task Learning with Labeled and Unlabeled Tasks,” 70:2807–16. ML Research Press, 2017."},"arxiv":1,"date_created":"2018-12-11T11:49:37Z","quality_controlled":"1","publist_id":"6399","_id":"999","date_published":"2017-06-08T00:00:00Z","publisher":"ML Research Press","oa_version":"Submitted Version","conference":{"end_date":"2017-08-11","location":"Sydney, Australia","name":"ICML: International Conference on Machine Learning","start_date":"2017-08-06"},"title":"Multi-task learning with labeled and unlabeled tasks"},{"page":"469-548","language":[{"iso":"eng"}],"year":"2017","abstract":[{"text":"We consider the cubic–quintic nonlinear Schrödinger equation: (mathematical formular)\r\nIn the first part of the paper, we analyze the one-parameter family of ground state solitons associated to this equation with particular attention to the shape of the associated mass/energy curve. Additionally, we are able to characterize the kernel of the linearized operator about such solitons and to demonstrate that they occur as optimizers for a one-parameter family of inequalities of Gagliardo–Nirenberg type. Building on this work, in the latter part of the paper we prove that scattering holds for solutions belonging to the region R of the mass/energy plane where the virial is positive. We show that this region is partially bounded by solitons also by rescalings of solitons (which are not soliton solutions in their own right). The discovery of rescaled solitons in this context is new and highlights an unexpected limitation of any virial-based methodology.","lang":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["1409.6734"]},"publication":"Archive for Rational Mechanics and Analysis","status":"public","day":"01","volume":225,"author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"last_name":"Oh","full_name":"Oh, Tadahiro","first_name":"Tadahiro"},{"first_name":"Oana","last_name":"Pocovnicu","full_name":"Pocovnicu, Oana"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica","last_name":"Visan"}],"intvolume":" 225","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"publication_status":"published","type":"journal_article","article_type":"original","month":"07","doi":"10.1007/s00205-017-1109-0","_id":"22071","oa_version":"Preprint","publisher":"Springer Nature","date_published":"2017-07-01T00:00:00Z","title":"Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3","extern":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1409.6734"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Killip R, Oh T, Pocovnicu O, Vişan M. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. Archive for Rational Mechanics and Analysis. 2017;225:469-548. doi:10.1007/s00205-017-1109-0","ista":"Killip R, Oh T, Pocovnicu O, Vişan M. 2017. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. Archive for Rational Mechanics and Analysis. 225, 469–548.","short":"R. Killip, T. Oh, O. Pocovnicu, M. Vişan, Archive for Rational Mechanics and Analysis 225 (2017) 469–548.","apa":"Killip, R., Oh, T., Pocovnicu, O., & Vişan, M. (2017). Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-017-1109-0","chicago":"Killip, Rowan, Tadahiro Oh, Oana Pocovnicu, and Monica Vişan. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” Archive for Rational Mechanics and Analysis. Springer Nature, 2017. https://doi.org/10.1007/s00205-017-1109-0.","mla":"Killip, Rowan, et al. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” Archive for Rational Mechanics and Analysis, vol. 225, Springer Nature, 2017, pp. 469–548, doi:10.1007/s00205-017-1109-0.","ieee":"R. Killip, T. Oh, O. Pocovnicu, and M. Vişan, “Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3,” Archive for Rational Mechanics and Analysis, vol. 225. Springer Nature, pp. 469–548, 2017."},"OA_place":"repository","scopus_import":"1","date_updated":"2026-06-30T10:52:12Z","date_created":"2026-06-19T08:21:38Z","arxiv":1,"OA_type":"green","quality_controlled":"1"},{"doi":"10.57262/die/1487386822","month":"03","das_tickbox":"1","article_type":"original","publication_status":"published","type":"journal_article","publication_identifier":{"issn":["0893-4983"]},"mathsc":["35Q55"],"author":[{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"first_name":"Jason","last_name":"Murphy","full_name":"Murphy, Jason"},{"full_name":"Visan, Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica"},{"full_name":"Zheng, Jiqiang","last_name":"Zheng","first_name":"Jiqiang"}],"intvolume":" 30","volume":30,"day":"01","status":"public","article_processing_charge":"No","external_id":{"arxiv":["1603.08912"]},"publication":"Differential and Integral Equations","abstract":[{"lang":"eng","text":"We consider the focusing cubic nonlinear Schrödinger equation with inverse-square potential in three space dimensions. We identify a sharp threshold between scattering and blowup, establishing a result analogous to that of Duyckaerts, Holmer, and Roudenko for the standard focusing cubic NLS. We also prove failure of uniform space-time bounds at the threshold."}],"year":"2017","page":"161-206","language":[{"iso":"eng"}],"quality_controlled":"1","OA_type":"green","arxiv":1,"date_created":"2026-06-19T08:47:48Z","issue":"3/4","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Killip, J. Murphy, M. Vişan, and J. Zheng, “The focusing cubic NLS with inverse-square potential in three space dimensions,” Differential and Integral Equations, vol. 30, no. 3/4. Khayyam Publishing, pp. 161–206, 2017.","mla":"Killip, Rowan, et al. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” Differential and Integral Equations, vol. 30, no. 3/4, Khayyam Publishing, 2017, pp. 161–206, doi:10.57262/die/1487386822.","chicago":"Killip, Rowan, Jason Murphy, Monica Vişan, and Jiqiang Zheng. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” Differential and Integral Equations. Khayyam Publishing, 2017. https://doi.org/10.57262/die/1487386822.","apa":"Killip, R., Murphy, J., Vişan, M., & Zheng, J. (2017). The focusing cubic NLS with inverse-square potential in three space dimensions. Differential and Integral Equations. Khayyam Publishing. https://doi.org/10.57262/die/1487386822","short":"R. Killip, J. Murphy, M. Vişan, J. Zheng, Differential and Integral Equations 30 (2017) 161–206.","ista":"Killip R, Murphy J, Vişan M, Zheng J. 2017. The focusing cubic NLS with inverse-square potential in three space dimensions. Differential and Integral Equations. 30(3/4), 161–206.","ama":"Killip R, Murphy J, Vişan M, Zheng J. The focusing cubic NLS with inverse-square potential in three space dimensions. Differential and Integral Equations. 2017;30(3/4):161-206. doi:10.57262/die/1487386822"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1603.08912"}],"OA_place":"repository","date_updated":"2026-07-01T12:42:38Z","scopus_import":"1","extern":"1","title":"The focusing cubic NLS with inverse-square potential in three space dimensions","publisher":"Khayyam Publishing","date_published":"2017-03-01T00:00:00Z","oa_version":"Preprint","_id":"22088"},{"license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"status":"public","related_material":{"record":[{"relation":"earlier_version","id":"5429","status":"public"},{"id":"5435","status":"public","relation":"earlier_version"},{"id":"1657","status":"public","relation":"earlier_version"}]},"year":"2017","language":[{"iso":"eng"}],"ddc":["004"],"publication":"Logical Methods in Computer Science","external_id":{"isi":["000419160800002"]},"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"article_number":"15","type":"journal_article","has_accepted_license":"1","isi":1,"publication_status":"published","das_tickbox":"1","month":"07","doi":"10.23638/LMCS-13(2:15)2017","volume":13,"intvolume":" 13","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Křetínská, Zuzana","last_name":"Křetínská","first_name":"Zuzana"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","day":"03","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"publication_identifier":{"issn":["1860-5974"]},"date_published":"2017-07-03T00:00:00Z","file":[{"file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","date_updated":"2020-07-14T12:46:33Z","checksum":"bfa405385ec6229ad5ead89ab5751639","content_type":"application/pdf","file_size":511832,"creator":"system","access_level":"open_access","relation":"main_file","file_id":"5354","date_created":"2018-12-12T10:18:32Z"}],"publisher":"International Federation for Computational Logic","oa_version":"Published Version","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","publist_id":"7355","_id":"466","date_created":"2018-12-11T11:46:38Z","issue":"2","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:33Z","pubrep_id":"957","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","grant_number":"701309"}],"scopus_import":"1","date_updated":"2026-07-06T13:26:27Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation for Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation for Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation for Computational Logic, 2017.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"scopus_import":"1","date_updated":"2026-07-06T13:27:53Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation for Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation for Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation for Computational Logic, 2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"pubrep_id":"955","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-11T11:46:37Z","issue":"3","publist_id":"7356","_id":"465","title":"Edit distance for pushdown automata","date_published":"2017-09-13T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2015-321-v1+1_main.pdf","file_size":279071,"checksum":"08041379ba408d40664f449eb5907a8f","content_type":"application/pdf","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:14:37Z","file_id":"5090","relation":"main_file"},{"access_level":"open_access","creator":"system","date_created":"2018-12-12T10:14:38Z","relation":"main_file","file_id":"5091","date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","file_size":279071,"content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f"}],"publisher":"International Federation for Computational Logic","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"publication_identifier":{"issn":["1860-5974"]},"volume":13,"intvolume":" 13","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"corr_author":"1","day":"13","das_tickbox":"1","month":"09","doi":"10.23638/LMCS-13(3:23)2017","type":"journal_article","publication_status":"published","has_accepted_license":"1","isi":1,"publication":"Logical Methods in Computer Science","external_id":{"isi":["000419163000005"]},"article_processing_charge":"No","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"related_material":{"record":[{"id":"5438","status":"public","relation":"earlier_version"},{"relation":"earlier_version","id":"1610","status":"public"}]},"year":"2017","language":[{"iso":"eng"}],"ddc":["004"],"ec_funded":1,"status":"public"},{"publication_identifier":{"issn":["1860-5974"]},"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"volume":13,"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika","first_name":"Veronika"}],"intvolume":" 13","day":"26","corr_author":"1","month":"09","doi":"10.23638/LMCS-13(3:26)2017","das_tickbox":"1","has_accepted_license":"1","publication_status":"published","isi":1,"type":"journal_article","article_processing_charge":"No","publication":"Logical Methods in Computer Science","external_id":{"isi":["000419163000001"],"arxiv":["1410.0833"]},"article_number":"26","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"related_material":{"record":[{"id":"1661","status":"public","relation":"earlier_version"}]},"year":"2017","ddc":["004"],"language":[{"iso":"eng"}],"ec_funded":1,"status":"public","oa":1,"citation":{"ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","apa":"Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation for Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation for Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation for Computational Logic, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2026-07-06T13:28:05Z","pubrep_id":"956","department":[{"_id":"KrCh"}],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:32Z","date_created":"2018-12-11T11:46:37Z","arxiv":1,"issue":"3","publist_id":"7357","_id":"464","title":"Improved algorithms for parity and Streett objectives","publisher":"International Federation for Computational Logic","date_published":"2017-09-26T00:00:00Z","file":[{"date_created":"2018-12-12T10:13:27Z","file_id":"5010","relation":"main_file","creator":"system","access_level":"open_access","file_size":582940,"content_type":"application/pdf","checksum":"12d469ae69b80361333d7dead965cf5d","date_updated":"2020-07-14T12:46:32Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf"}],"oa_version":"Published Version"}]