[{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T08:06:06Z","citation":{"ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In Contemporary Computational Mathematics, 131–34. Springer, 2018. https://doi.org/10.1007/978-3-319-72456-0_7.","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7","ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” Contemporary Computational Mathematics, Springer, 2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7."},"department":[{"_id":"TaHa"}],"title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","article_processing_charge":"No","external_id":{"arxiv":["1509.06286"]},"publist_id":"7993","author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","full_name":"Mellit, Anton","last_name":"Mellit"},{"first_name":"Andriy","full_name":"Prymak, Andriy","last_name":"Prymak"},{"full_name":"Radchenko, Danylo","last_name":"Radchenko","first_name":"Danylo"},{"last_name":"Viazovska","full_name":"Viazovska, Maryna","first_name":"Maryna"}],"_id":"61","status":"public","type":"book_chapter","language":[{"iso":"eng"}],"publication":"Contemporary Computational Mathematics","day":"23","publication_status":"published","year":"2018","date_created":"2018-12-11T11:44:25Z","doi":"10.1007/978-3-319-72456-0_7","date_published":"2018-05-23T00:00:00Z","page":"131 - 134","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. "}],"month":"05","main_file_link":[{"url":"https://arxiv.org/abs/1509.06286","open_access":"1"}],"oa":1,"quality_controlled":"1","publisher":"Springer"},{"_id":"6354","status":"public","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2021-01-12T08:07:12Z","file_date_updated":"2020-07-14T12:47:28Z","department":[{"_id":"MiSi"}],"oa_version":"Published Version","abstract":[{"text":"Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.","lang":"eng"}],"month":"09","intvolume":" 8","file":[{"file_id":"6360","checksum":"d4588377e789da7f360b553ae02c5119","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_BioProtocol_Fan.pdf","date_created":"2019-04-30T08:04:33Z","file_size":2928337,"date_updated":"2020-07-14T12:47:28Z","creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2331-8325"]},"publication_status":"published","volume":8,"issue":"18","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","article_number":"e3018","project":[{"grant_number":"747687","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018","ama":"Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018","ieee":"S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol, 2018.","short":"S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).","mla":"Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018.","ista":"Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 8(18), e3018.","chicago":"Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol, 2018. https://doi.org/10.21769/bioprotoc.3018."},"title":"Platelet migration and bacterial trapping assay under flow","author":[{"last_name":"Fan","full_name":"Fan, Shuxia","first_name":"Shuxia"},{"last_name":"Lorenz","full_name":"Lorenz, Michael","first_name":"Michael"},{"last_name":"Massberg","full_name":"Massberg, Steffen","first_name":"Steffen"},{"id":"397A88EE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian R","full_name":"Gärtner, Florian R","orcid":"0000-0001-6120-3723","last_name":"Gärtner"}],"acknowledgement":" FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.)","quality_controlled":"1","publisher":"Bio-Protocol","oa":1,"day":"20","publication":"Bio-Protocol","has_accepted_license":"1","year":"2018","date_published":"2018-09-20T00:00:00Z","doi":"10.21769/bioprotoc.3018","date_created":"2019-04-29T09:40:33Z"},{"page":"189-218","date_published":"2018-01-01T00:00:00Z","doi":"10.1093/oso/9780198802013.003.0009","date_created":"2019-06-06T12:42:01Z","publication_identifier":{"isbn":["9780198802013","9780191840500"]},"publication_status":"published","year":"2018","day":"01","publication":"Geometry and Physics: Volume I","language":[{"iso":"eng"}],"scopus_import":1,"quality_controlled":"1","publisher":"Oxford University Press","month":"01","abstract":[{"lang":"eng","text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal."}],"oa_version":"None","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","full_name":"Hausel, Tamás","last_name":"Hausel"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","full_name":"Mellit, Anton","last_name":"Mellit"},{"last_name":"Pei","full_name":"Pei, Du","first_name":"Du"}],"department":[{"_id":"TaHa"}],"title":"Mirror symmetry with branes by equivariant verlinde formulas","citation":{"ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In Geometry and Physics: Volume I, 189–218. Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198802013.003.0009.","ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","apa":"Hausel, T., Mellit, A., & Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp. 189–218). Oxford University Press. https://doi.org/10.1093/oso/9780198802013.003.0009","ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. Oxford University Press; 2018:189-218. doi:10.1093/oso/9780198802013.003.0009","mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218, doi:10.1093/oso/9780198802013.003.0009."},"date_updated":"2021-01-12T08:07:52Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","status":"public","_id":"6525"},{"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:09:33Z","status":"public","type":"journal_article","_id":"690","volume":171,"issue":"1-2","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"06","intvolume":" 171","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1."}],"title":"Local law and Tracy–Widom limit for sparse random matrices","author":[{"last_name":"Lee","full_name":"Lee, Jii","first_name":"Jii"},{"first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli","full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231"}],"publist_id":"7017","external_id":{"arxiv":["1605.08767"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018)."},"project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"543-616","date_published":"2018-06-14T00:00:00Z","doi":"10.1007/s00440-017-0787-8","date_created":"2018-12-11T11:47:56Z","day":"14","publication":"Probability Theory and Related Fields","year":"2018","publisher":"Springer","quality_controlled":"1","oa":1},{"year":"2018","day":"01","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","page":"1668-1682","doi":"10.1109/TPAMI.2017.2730884","date_published":"2018-07-01T00:00:00Z","date_created":"2018-12-11T11:48:01Z","quality_controlled":"1","publisher":"IEEE","oa":1,"citation":{"ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Shekhovtsov, Alexander","last_name":"Shekhovtsov","first_name":"Alexander"},{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"publist_id":"6992","external_id":{"arxiv":["1508.07902"]},"title":"Maximum persistency via iterative relaxed inference with graphical models","publication_identifier":{"issn":["01628828"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":40,"issue":"7","abstract":[{"lang":"eng","text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision."}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"month":"07","intvolume":" 40","date_updated":"2021-01-12T08:11:32Z","department":[{"_id":"VlKo"}],"_id":"703","type":"journal_article","status":"public"}]