[{"date_published":"2019-12-01T00:00:00Z","page":"927-938","citation":{"mla":"Wendler, Chris, et al. Powerset Convolutional Neural Networks. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.","short":"C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.","chicago":"Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.","ama":"Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.","ista":"Wendler C, Alistarh D-A, Püschel M. 2019. Powerset convolutional neural networks. NIPS: Conference on Neural Information Processing Systems vol. 32, 927–938.","apa":"Wendler, C., Alistarh, D.-A., & Püschel, M. (2019). Powerset convolutional neural networks (Vol. 32, pp. 927–938). Presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938."},"article_processing_charge":"No","day":"01","oa_version":"Published Version","intvolume":" 32","status":"public","title":"Powerset convolutional neural networks","_id":"7542","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We present a novel class of convolutional neural networks (CNNs) for set functions,i.e., data indexed with the powerset of a finite set. The convolutions are derivedas linear, shift-equivariant functions for various notions of shifts on set functions.The framework is fundamentally different from graph convolutions based on theLaplacian, as it provides not one but several basic shifts, one for each element inthe ground set. Prototypical experiments with several set function classificationtasks on synthetic datasets and on datasets derived from real-world hypergraphsdemonstrate the potential of our new powerset CNNs."}],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2019-12-14","start_date":"2019-12-08","location":"Vancouver, Canada","name":"NIPS: Conference on Neural Information Processing Systems"},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"arxiv":["1909.02253"],"isi":["000534424300084"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://papers.nips.cc/paper/8379-powerset-convolutional-neural-networks"}],"publication_identifier":{"issn":["1049-5258"]},"month":"12","volume":32,"date_created":"2020-02-28T10:03:24Z","date_updated":"2023-09-08T11:13:52Z","author":[{"full_name":"Wendler, Chris","last_name":"Wendler","first_name":"Chris"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Püschel","first_name":"Markus","full_name":"Püschel, Markus"}],"department":[{"_id":"DaAl"}],"publisher":"Neural Information Processing Systems Foundation","publication_status":"published","year":"2019","ec_funded":1},{"title":"Social immunity","status":"public","publication_status":"published","editor":[{"last_name":"Choe","first_name":"Jae","full_name":"Choe, Jae"}],"department":[{"_id":"SyCr"}],"publisher":"Elsevier","_id":"7513","year":"2019","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-02-23T23:00:36Z","date_updated":"2023-09-08T11:12:04Z","oa_version":"None","author":[{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"id":"29D0B332-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8696-6978","first_name":"Megan","last_name":"Kutzer","full_name":"Kutzer, Megan"}],"edition":"2","type":"book_chapter","abstract":[{"lang":"eng","text":"Social insects (i.e., ants, termites and the social bees and wasps) protect their colonies from disease using a combination of individual immunity and collectively performed defenses, termed social immunity. The first line of social immune defense is sanitary care, which is performed by colony members to protect their pathogen-exposed nestmates from developing an infection. If sanitary care fails and an infection becomes established, a second line of social immune defense is deployed to stop disease transmission within the colony and to protect the valuable queens, which together with the males are the reproductive individuals of the colony. Insect colonies are separated into these reproductive individuals and the sterile worker force, forming a superorganismal reproductive unit reminiscent of the differentiated germline and soma in a multicellular organism. Ultimately, the social immune response preserves the germline of the superorganism insect colony and increases overall fitness of the colony in case of disease. "}],"quality_controlled":"1","isi":1,"page":"747-755","publication":"Encyclopedia of Animal Behavior","external_id":{"isi":["000248989500026"]},"citation":{"chicago":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” In Encyclopedia of Animal Behavior, edited by Jae Choe, 2nd ed., 747–55. Elsevier, 2019. https://doi.org/10.1016/B978-0-12-809633-8.90721-0.","mla":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” Encyclopedia of Animal Behavior, edited by Jae Choe, 2nd ed., Elsevier, 2019, pp. 747–55, doi:10.1016/B978-0-12-809633-8.90721-0.","short":"S. Cremer, M. Kutzer, in:, J. Choe (Ed.), Encyclopedia of Animal Behavior, 2nd ed., Elsevier, 2019, pp. 747–755.","ista":"Cremer S, Kutzer M. 2019.Social immunity. In: Encyclopedia of Animal Behavior. , 747–755.","ieee":"S. Cremer and M. Kutzer, “Social immunity,” in Encyclopedia of Animal Behavior, 2nd ed., J. Choe, Ed. Elsevier, 2019, pp. 747–755.","apa":"Cremer, S., & Kutzer, M. (2019). Social immunity. In J. Choe (Ed.), Encyclopedia of Animal Behavior (2nd ed., pp. 747–755). Elsevier. https://doi.org/10.1016/B978-0-12-809633-8.90721-0","ama":"Cremer S, Kutzer M. Social immunity. In: Choe J, ed. Encyclopedia of Animal Behavior. 2nd ed. Elsevier; 2019:747-755. doi:10.1016/B978-0-12-809633-8.90721-0"},"language":[{"iso":"eng"}],"doi":"10.1016/B978-0-12-809633-8.90721-0","date_published":"2019-02-06T00:00:00Z","scopus_import":"1","day":"06","month":"02","article_processing_charge":"No","publication_identifier":{"eisbn":["9780128132524"],"isbn":["9780128132517"]}},{"type":"conference","abstract":[{"text":"Bending-active structures are able to efficiently produce complex curved shapes starting from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match the global curvature (i.e., bending requests) of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arc that fits a bounding box of 3.90x3.96x3.25 meters.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9261","year":"2019","publisher":"International Center for Numerical Methods in Engineering","department":[{"_id":"BeBi"}],"publication_status":"published","title":"FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels","status":"public","author":[{"full_name":"Laccone, Francesco","last_name":"Laccone","first_name":"Francesco"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"full_name":"Perez Rodriguez, Jesus","first_name":"Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"full_name":"Ponchio, Federico","last_name":"Ponchio","first_name":"Federico"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"}],"oa_version":"None","date_created":"2021-03-21T23:01:21Z","date_updated":"2023-09-08T11:21:54Z","scopus_import":"1","publication_identifier":{"issn":["2518-6582"],"isbn":["9788412110104"]},"article_processing_charge":"No","month":"10","day":"10","citation":{"ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels. In: IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE. International Center for Numerical Methods in Engineering; 2019:509-515.","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2019. FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels. IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE. IASS: International Association for Shell and Spatial Structures, 509–515.","ieee":"F. Laccone et al., “FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels,” in IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE, Barcelona, Spain, 2019, pp. 509–515.","apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2019). FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels. In IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE (pp. 509–515). Barcelona, Spain: International Center for Numerical Methods in Engineering.","mla":"Laccone, Francesco, et al. “FlexMaps Pavilion: A Twisted Arc Made of Mesostructured Flat Flexible Panels.” IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE, International Center for Numerical Methods in Engineering, 2019, pp. 509–15.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, in:, IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE, International Center for Numerical Methods in Engineering, 2019, pp. 509–515.","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “FlexMaps Pavilion: A Twisted Arc Made of Mesostructured Flat Flexible Panels.” In IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE, 509–15. International Center for Numerical Methods in Engineering, 2019."},"external_id":{"isi":["000563497600059"]},"publication":"IASS Symposium 2019 - 60th Anniversary Symposium of the International Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International Conference on Textile Composites and Inflatable Structures, FORM and FORCE","page":"509-515","isi":1,"quality_controlled":"1","date_published":"2019-10-10T00:00:00Z","conference":{"name":"IASS: International Association for Shell and Spatial Structures","location":"Barcelona, Spain","start_date":"2019-10-07","end_date":"2019-10-10"},"language":[{"iso":"eng"}]},{"month":"10","publication_identifier":{"isbn":["9781728150239"]},"quality_controlled":"1","isi":1,"project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"external_id":{"isi":["000554591601098"],"arxiv":["1807.02136"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1807.02136","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2019-10-28","location":"Seoul, South Korea","start_date":"2019-10-27","name":"ICCVW: International Conference on Computer Vision Workshop"},"doi":"10.1109/ICCVW.2019.00217","article_number":"1749-1753","ec_funded":1,"publication_status":"published","publisher":"IEEE","department":[{"_id":"ChLa"}],"year":"2019","date_created":"2020-04-05T22:00:51Z","date_updated":"2023-09-08T11:18:37Z","author":[{"first_name":"Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"full_name":"Kuznetsova, Alina","first_name":"Alina","last_name":"Kuznetsova"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"}],"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","citation":{"ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00217","ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., & Ferrari, V. (2019). Detecting visual relationships using box attention. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00217","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 1749–1753, IEEE, 2019, doi:10.1109/ICCVW.2019.00217.","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00217."},"date_published":"2019-10-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results."}],"status":"public","title":"Detecting visual relationships using box attention","_id":"7640","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint"},{"scopus_import":"1","month":"10","day":"01","article_processing_charge":"No","publication_identifier":{"isbn":["9781728150239"]},"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","external_id":{"isi":["000554591600090"]},"citation":{"mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00097.","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., & Blaschko, M. B. (2019). Function norms for neural networks. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00097"},"quality_controlled":"1","isi":1,"conference":{"name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","location":"Seoul, South Korea","start_date":"2019-10-27"},"date_published":"2019-10-01T00:00:00Z","doi":"10.1109/ICCVW.2019.00097","language":[{"iso":"eng"}],"article_number":"748-752","type":"conference","abstract":[{"text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7639","year":"2019","publication_status":"published","status":"public","title":"Function norms for neural networks","department":[{"_id":"VlKo"}],"publisher":"IEEE","author":[{"full_name":"Rannen-Triki, Amal","first_name":"Amal","last_name":"Rannen-Triki"},{"full_name":"Berman, Maxim","first_name":"Maxim","last_name":"Berman"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Blaschko, Matthew B.","first_name":"Matthew B.","last_name":"Blaschko"}],"date_updated":"2023-09-08T11:19:12Z","date_created":"2020-04-05T22:00:50Z","oa_version":"None"},{"month":"07","publication_identifier":{"isbn":["9781119429142"]},"external_id":{"isi":["000261343000003"]},"isi":1,"quality_controlled":"1","doi":"10.1002/9781119487845.ch4","language":[{"iso":"eng"}],"year":"2019","publication_status":"published","department":[{"_id":"NiBa"}],"editor":[{"full_name":"Balding, David","last_name":"Balding","first_name":"David"},{"first_name":"Ida","last_name":"Moltke","full_name":"Moltke, Ida"},{"first_name":"John","last_name":"Marioni","full_name":"Marioni, John"}],"publisher":"Wiley","author":[{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"}],"edition":"4","date_updated":"2023-09-08T11:24:15Z","date_created":"2020-08-21T04:25:39Z","day":"29","article_processing_charge":"No","publication":"Handbook of statistical genomics","citation":{"apa":"Barton, N. H., & Etheridge, A. (2019). Mathematical models in population genetics. In D. Balding, I. Moltke, & J. Marioni (Eds.), Handbook of statistical genomics (4th ed., pp. 115–144). Wiley. https://doi.org/10.1002/9781119487845.ch4","ieee":"N. H. Barton and A. Etheridge, “Mathematical models in population genetics,” in Handbook of statistical genomics, 4th ed., D. Balding, I. Moltke, and J. Marioni, Eds. Wiley, 2019, pp. 115–144.","ista":"Barton NH, Etheridge A. 2019.Mathematical models in population genetics. In: Handbook of statistical genomics. , 115–144.","ama":"Barton NH, Etheridge A. Mathematical models in population genetics. In: Balding D, Moltke I, Marioni J, eds. Handbook of Statistical Genomics. 4th ed. Wiley; 2019:115-144. doi:10.1002/9781119487845.ch4","chicago":"Barton, Nicholas H, and Alison Etheridge. “Mathematical Models in Population Genetics.” In Handbook of Statistical Genomics, edited by David Balding, Ida Moltke, and John Marioni, 4th ed., 115–44. Wiley, 2019. https://doi.org/10.1002/9781119487845.ch4.","short":"N.H. Barton, A. Etheridge, in:, D. Balding, I. Moltke, J. Marioni (Eds.), Handbook of Statistical Genomics, 4th ed., Wiley, 2019, pp. 115–144.","mla":"Barton, Nicholas H., and Alison Etheridge. “Mathematical Models in Population Genetics.” Handbook of Statistical Genomics, edited by David Balding et al., 4th ed., Wiley, 2019, pp. 115–44, doi:10.1002/9781119487845.ch4."},"page":"115-144","date_published":"2019-07-29T00:00:00Z","type":"book_chapter","abstract":[{"lang":"eng","text":"We review the history of population genetics, starting with its origins a century ago from the synthesis between Mendel and Darwin's ideas, through to the recent development of sophisticated schemes of inference from sequence data, based on the coalescent. We explain the close relation between the coalescent and a diffusion process, which we illustrate by their application to understand spatial structure. We summarise the powerful methods available for analysis of multiple loci, when linkage equilibrium can be assumed, and then discuss approaches to the more challenging case, where associations between alleles require that we follow genotype, rather than allele, frequencies. Though we can hardly cover the whole of population genetics, we give an overview of the current state of the subject, and future challenges to it."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8281","ddc":["576"],"status":"public","title":"Mathematical models in population genetics","oa_version":"None"},{"article_number":"1908.08731","type":"preprint","abstract":[{"text":"Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if r is not a prime power and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this further (for d large compared to r): If r is not a prime power and N := (d+ 1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the r-fold van Kampen–Flores conjecture we also produce counterexamples which are stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the Ozaydin theorem on existence of equivariant maps. ","lang":"eng"}],"_id":"8184","year":"2019","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We would like to thank F. Frick for helpful discussions","status":"public","title":"Stronger counterexamples to the topological Tverberg conjecture","publication_status":"submitted","publisher":"arXiv","department":[{"_id":"UlWa"}],"author":[{"first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"first_name":"R.","last_name":"Karasev","full_name":"Karasev, R."},{"full_name":"Skopenkov, A.","last_name":"Skopenkov","first_name":"A."}],"related_material":{"record":[{"id":"8156","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-08T11:20:02Z","date_created":"2020-07-30T10:45:34Z","oa_version":"Preprint","day":"23","month":"08","article_processing_charge":"No","publication":"arXiv","external_id":{"isi":["000986519600004"],"arxiv":["1908.08731"]},"oa":1,"citation":{"ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv.","ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731.","apa":"Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” arXiv. arXiv.","mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, arXiv.","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv. arXiv, n.d."},"main_file_link":[{"url":"https://arxiv.org/abs/1908.08731","open_access":"1"}],"isi":1,"project":[{"grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory"}],"date_published":"2019-08-23T00:00:00Z","language":[{"iso":"eng"}]},{"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/426"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-17259-6_11","conference":{"name":"PKC: Public-Key Cryptograhy","start_date":"2019-04-14","location":"Beijing, China","end_date":"2019-04-17"},"publication_identifier":{"isbn":["9783030172589"],"eissn":["16113349"],"issn":["03029743"]},"month":"04","publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2019","volume":11443,"date_created":"2019-05-13T08:13:46Z","date_updated":"2023-09-08T11:33:20Z","related_material":{"record":[{"id":"10035","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg","full_name":"Fuchsbauer, Georg"},{"first_name":"Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"ec_funded":1,"page":"317-346","citation":{"ista":"Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.","ieee":"G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing, China, 2019, vol. 11443, pp. 317–346.","apa":"Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2019). Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-030-17259-6_11","ama":"Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11","chicago":"Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z Pietrzak. “Adaptively Secure Proxy Re-Encryption,” 11443:317–46. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-17259-6_11.","mla":"Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.","short":"G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346."},"date_published":"2019-04-06T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"06","intvolume":" 11443","title":"Adaptively secure proxy re-encryption","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6430","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"A proxy re-encryption (PRE) scheme is a public-key encryption scheme that allows the holder of a key pk to derive a re-encryption key for any other key 𝑝𝑘′. This re-encryption key lets anyone transform ciphertexts under pk into ciphertexts under 𝑝𝑘′ without having to know the underlying message, while transformations from 𝑝𝑘′ to pk should not be possible (unidirectional). Security is defined in a multi-user setting against an adversary that gets the users’ public keys and can ask for re-encryption keys and can corrupt users by requesting their secret keys. Any ciphertext that the adversary cannot trivially decrypt given the obtained secret and re-encryption keys should be secure.\r\n\r\nAll existing security proofs for PRE only show selective security, where the adversary must first declare the users it wants to corrupt. This can be lifted to more meaningful adaptive security by guessing the set of corrupted users among the n users, which loses a factor exponential in Open image in new window , rendering the result meaningless already for moderate Open image in new window .\r\n\r\nJafargholi et al. (CRYPTO’17) proposed a framework that in some cases allows to give adaptive security proofs for schemes which were previously only known to be selectively secure, while avoiding the exponential loss that results from guessing the adaptive choices made by an adversary. We apply their framework to PREs that satisfy some natural additional properties. Concretely, we give a more fine-grained reduction for several unidirectional PREs, proving adaptive security at a much smaller loss. The loss depends on the graph of users whose edges represent the re-encryption keys queried by the adversary. For trees and chains the loss is quasi-polynomial in the size and for general graphs it is exponential in their depth and indegree (instead of their size as for previous reductions). Fortunately, trees and low-depth graphs cover many, if not most, interesting applications.\r\n\r\nOur results apply e.g. to the bilinear-map based PRE schemes by Ateniese et al. (NDSS’05 and CT-RSA’09), Gentry’s FHE-based scheme (STOC’09) and the LWE-based scheme by Chandran et al. (PKC’14)."}]},{"language":[{"iso":"eng"}],"doi":"10.1038/s41467-019-08916-5","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000459704600001"]},"publication_identifier":{"issn":["2041-1723"]},"month":"02","volume":10,"date_updated":"2023-09-08T11:39:02Z","date_created":"2019-03-05T13:18:30Z","author":[{"full_name":"Mayzel, Jonathan","last_name":"Mayzel","first_name":"Jonathan"},{"full_name":"Steinberg, Victor","first_name":"Victor","last_name":"Steinberg"},{"orcid":"0000-0002-3072-5999","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","last_name":"Varshney","first_name":"Atul","full_name":"Varshney, Atul"}],"publisher":"Springer Nature","department":[{"_id":"BjHo"}],"publication_status":"published","year":"2019","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file_date_updated":"2020-07-14T12:47:18Z","article_number":"937","date_published":"2019-02-26T00:00:00Z","citation":{"chicago":"Mayzel, Jonathan, Victor Steinberg, and Atul Varshney. “Stokes Flow Analogous to Viscous Electron Current in Graphene.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-08916-5.","short":"J. Mayzel, V. Steinberg, A. Varshney, Nature Communications 10 (2019).","mla":"Mayzel, Jonathan, et al. “Stokes Flow Analogous to Viscous Electron Current in Graphene.” Nature Communications, vol. 10, 937, Springer Nature, 2019, doi:10.1038/s41467-019-08916-5.","ieee":"J. Mayzel, V. Steinberg, and A. Varshney, “Stokes flow analogous to viscous electron current in graphene,” Nature Communications, vol. 10. Springer Nature, 2019.","apa":"Mayzel, J., Steinberg, V., & Varshney, A. (2019). Stokes flow analogous to viscous electron current in graphene. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-08916-5","ista":"Mayzel J, Steinberg V, Varshney A. 2019. Stokes flow analogous to viscous electron current in graphene. Nature Communications. 10, 937.","ama":"Mayzel J, Steinberg V, Varshney A. Stokes flow analogous to viscous electron current in graphene. Nature Communications. 2019;10. doi:10.1038/s41467-019-08916-5"},"publication":"Nature Communications","has_accepted_license":"1","article_processing_charge":"No","day":"26","scopus_import":"1","file":[{"file_name":"2019_NatureComm_Mayzel.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2646391,"creator":"dernst","relation":"main_file","file_id":"6070","date_created":"2019-03-05T13:33:04Z","date_updated":"2020-07-14T12:47:18Z","checksum":"61192fc49e0d44907c2a4fe384e4b97f"}],"oa_version":"Published Version","intvolume":" 10","status":"public","ddc":["530","532"],"title":"Stokes flow analogous to viscous electron current in graphene","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6069","abstract":[{"text":"Electron transport in two-dimensional conducting materials such as graphene, with dominant electron–electron interaction, exhibits unusual vortex flow that leads to a nonlocal current-field relation (negative resistance), distinct from the classical Ohm’s law. The transport behavior of these materials is best described by low Reynolds number hydrodynamics, where the constitutive pressure–speed relation is Stoke’s law. Here we report evidence of such vortices observed in a viscous flow of Newtonian fluid in a microfluidic device consisting of a rectangular cavity—analogous to the electronic system. We extend our experimental observations to elliptic cavities of different eccentricities, and validate them by numerically solving bi-harmonic equation obtained for the viscous flow with no-slip boundary conditions. We verify the existence of a predicted threshold at which vortices appear. Strikingly, we find that a two-dimensional theoretical model captures the essential features of three-dimensional Stokes flow in experiments.","lang":"eng"}],"type":"journal_article"},{"ec_funded":1,"file_date_updated":"2020-07-14T12:47:17Z","article_number":"652","author":[{"first_name":"Atul","last_name":"Varshney","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3072-5999","full_name":"Varshney, Atul"},{"full_name":"Steinberg, Victor","first_name":"Victor","last_name":"Steinberg"}],"volume":10,"date_created":"2019-02-15T07:10:46Z","date_updated":"2023-09-08T11:39:54Z","year":"2019","publisher":"Springer Nature","department":[{"_id":"BjHo"}],"publication_status":"published","publication_identifier":{"issn":["2041-1723"]},"month":"02","doi":"10.1038/s41467-019-08551-0","language":[{"iso":"eng"}],"external_id":{"arxiv":["1902.03763"],"isi":["000458175300001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"isi":1,"quality_controlled":"1","abstract":[{"text":"Speed of sound waves in gases and liquids are governed by the compressibility of the medium. There exists another type of non-dispersive wave where the wave speed depends on stress instead of elasticity of the medium. A well-known example is the Alfven wave, which propagates through plasma permeated by a magnetic field with the speed determined by magnetic tension. An elastic analogue of Alfven waves has been predicted in a flow of dilute polymer solution where the elastic stress of the stretching polymers determines the elastic wave speed. Here we present quantitative evidence of elastic Alfven waves in elastic turbulence of a viscoelastic creeping flow between two obstacles in channel flow. The key finding in the experimental proof is a nonlinear dependence of the elastic wave speed cel on the Weissenberg number Wi, which deviates from predictions based on a model of linear polymer elasticity.","lang":"eng"}],"type":"journal_article","file":[{"creator":"dernst","file_size":1331490,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_NatureComm_Varshney.pdf","checksum":"d3acf07eaad95ec040d8e8565fc9ac37","date_updated":"2020-07-14T12:47:17Z","date_created":"2019-02-15T07:15:00Z","file_id":"6015","relation":"main_file"}],"oa_version":"Published Version","_id":"6014","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 10","ddc":["530"],"status":"public","title":"Elastic alfven waves in elastic turbulence","has_accepted_license":"1","article_processing_charge":"No","day":"08","scopus_import":"1","date_published":"2019-02-08T00:00:00Z","citation":{"ieee":"A. Varshney and V. Steinberg, “Elastic alfven waves in elastic turbulence,” Nature Communications, vol. 10. Springer Nature, 2019.","apa":"Varshney, A., & Steinberg, V. (2019). Elastic alfven waves in elastic turbulence. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-08551-0","ista":"Varshney A, Steinberg V. 2019. Elastic alfven waves in elastic turbulence. Nature Communications. 10, 652.","ama":"Varshney A, Steinberg V. Elastic alfven waves in elastic turbulence. Nature Communications. 2019;10. doi:10.1038/s41467-019-08551-0","chicago":"Varshney, Atul, and Victor Steinberg. “Elastic Alfven Waves in Elastic Turbulence.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-08551-0.","short":"A. Varshney, V. Steinberg, Nature Communications 10 (2019).","mla":"Varshney, Atul, and Victor Steinberg. “Elastic Alfven Waves in Elastic Turbulence.” Nature Communications, vol. 10, 652, Springer Nature, 2019, doi:10.1038/s41467-019-08551-0."},"publication":"Nature Communications","article_type":"original"}]