[{"isi":1,"intvolume":"        14","status":"public","article_number":"2182","date_created":"2023-01-12T12:08:31Z","month":"10","volume":14,"issue":"10","article_type":"original","publisher":"MDPI","file_date_updated":"2023-01-24T10:56:12Z","ddc":["530"],"oa":1,"_id":"12154","title":"First and second sound in two-dimensional bosonic and fermionic superfluids","publication":"Symmetry","publication_status":"published","abstract":[{"text":"We review our theoretical results of the sound propagation in two-dimensional (2D) systems of ultracold fermionic and bosonic atoms. In the superfluid phase, characterized by the spontaneous symmetry breaking of the U(1) symmetry, there is the coexistence of first and second sound. In the case of weakly-interacting repulsive bosons, we model the recent measurements of the sound velocities of 39K atoms in 2D obtained in the weakly-interacting regime and around the Berezinskii–Kosterlitz–Thouless (BKT) superfluid-to-normal transition temperature. In particular, we perform a quite accurate computation of the superfluid density and show that it is reasonably consistent with the experimental results. For superfluid attractive fermions, we calculate the first and second sound velocities across the whole BCS-BEC crossover. In the low-temperature regime, we reproduce the recent measurements of first-sound speed with 6Li atoms. We also predict that there is mixing between sound modes only in the finite-temperature BEC regime.","lang":"eng"}],"author":[{"full_name":"Salasnich, Luca","first_name":"Luca","last_name":"Salasnich"},{"full_name":"Cappellaro, Alberto","orcid":"0000-0001-6110-2359","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","first_name":"Alberto","last_name":"Cappellaro"},{"full_name":"Furutani, Koichiro","first_name":"Koichiro","last_name":"Furutani"},{"full_name":"Tononi, Andrea","last_name":"Tononi","first_name":"Andrea"},{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","first_name":"Giacomo","last_name":"Bighin"}],"quality_controlled":"1","citation":{"short":"L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, G. Bighin, Symmetry 14 (2022).","chicago":"Salasnich, Luca, Alberto Cappellaro, Koichiro Furutani, Andrea Tononi, and Giacomo Bighin. “First and Second Sound in Two-Dimensional Bosonic and Fermionic Superfluids.” <i>Symmetry</i>. MDPI, 2022. <a href=\"https://doi.org/10.3390/sym14102182\">https://doi.org/10.3390/sym14102182</a>.","ista":"Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. 2022. First and second sound in two-dimensional bosonic and fermionic superfluids. Symmetry. 14(10), 2182.","ama":"Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. First and second sound in two-dimensional bosonic and fermionic superfluids. <i>Symmetry</i>. 2022;14(10). doi:<a href=\"https://doi.org/10.3390/sym14102182\">10.3390/sym14102182</a>","ieee":"L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, and G. Bighin, “First and second sound in two-dimensional bosonic and fermionic superfluids,” <i>Symmetry</i>, vol. 14, no. 10. MDPI, 2022.","apa":"Salasnich, L., Cappellaro, A., Furutani, K., Tononi, A., &#38; Bighin, G. (2022). First and second sound in two-dimensional bosonic and fermionic superfluids. <i>Symmetry</i>. MDPI. <a href=\"https://doi.org/10.3390/sym14102182\">https://doi.org/10.3390/sym14102182</a>","mla":"Salasnich, Luca, et al. “First and Second Sound in Two-Dimensional Bosonic and Fermionic Superfluids.” <i>Symmetry</i>, vol. 14, no. 10, 2182, MDPI, 2022, doi:<a href=\"https://doi.org/10.3390/sym14102182\">10.3390/sym14102182</a>."},"year":"2022","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["2073-8994"]},"scopus_import":"1","date_published":"2022-10-17T00:00:00Z","keyword":["Physics and Astronomy (miscellaneous)","General Mathematics","Chemistry (miscellaneous)","Computer Science (miscellaneous)"],"file":[{"file_id":"12361","date_updated":"2023-01-24T10:56:12Z","success":1,"access_level":"open_access","file_name":"2022_Symmetry_Salsnich.pdf","checksum":"9b6bd0e484834dd76d7b26e3c5fba8bd","date_created":"2023-01-24T10:56:12Z","relation":"main_file","file_size":843723,"content_type":"application/pdf","creator":"dernst"}],"external_id":{"isi":["000875039200001"]},"doi":"10.3390/sym14102182","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"MiLe"}],"acknowledgement":"This research is partially supported by University of Padova, BIRD grant “Ultracold atoms\r\nin curved geometries”. KF is supported by Fondazione CARIPARO with a PhD fellowship. AT is\r\npartially supported by French National Research Agency ANR Grant Droplets N. ANR-19-CE30-0003-02. LS thanks Herwig Ott and Sandro Wimberger for their kind invitation to the\r\nInternational Workshop “Quantum Transport with ultracold atoms” (2022).","article_processing_charge":"Yes","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"17","type":"journal_article","date_updated":"2023-08-09T10:13:17Z","oa_version":"Published Version"},{"external_id":{"arxiv":["2005.07637"]},"keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"date_published":"2021-03-01T00:00:00Z","page":"1-33","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["2476-1249"]},"oa_version":"Preprint","date_updated":"2023-09-26T10:40:55Z","type":"journal_article","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","ec_funded":1,"department":[{"_id":"DaAl"}],"doi":"10.1145/3447384","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","article_type":"original","issue":"1","volume":5,"month":"03","date_created":"2022-03-18T09:10:27Z","status":"public","intvolume":"         5","year":"2021","citation":{"ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"last_name":"Korhonen","first_name":"Janne","full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"quality_controlled":"1","project":[{"name":"Coordination in constrained and natural distributed systems","grant_number":"840605","call_identifier":"H2020","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"},{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"publication_status":"published","title":"Input-dynamic distributed algorithms for communication networks","publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","_id":"10855","related_material":{"record":[{"status":"public","relation":"shorter_version","id":"10854"}]},"oa":1},{"keyword":["Computational Mathematics","Marketing","Economics and Econometrics","Statistics and Probability","Computer Science (miscellaneous)"],"date_published":"2015-12-02T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["2167-8383"],"issn":["2167-8375"]},"day":"02","oa_version":"None","type":"journal_article","date_updated":"2023-02-09T10:08:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"We would like to thank Veronika Loitzenbauer and the anonymous referees for their valuable feedback.","doi":"10.1145/2716312","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","article_type":"original","volume":4,"issue":"1","article_number":"1","status":"public","month":"12","date_created":"2022-07-27T12:43:18Z","intvolume":"         4","year":"2015","extern":"1","author":[{"last_name":"Dütting","first_name":"Paul","full_name":"Dütting, Paul"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"}],"quality_controlled":"1","citation":{"short":"P. Dütting, M.H. Henzinger, I. Weber, ACM Transactions on Economics and Computation 4 (2015).","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “An Expressive Mechanism for Auctions on the Web.” <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery, 2015. <a href=\"https://doi.org/10.1145/2716312\">https://doi.org/10.1145/2716312</a>.","ista":"Dütting P, Henzinger MH, Weber I. 2015. An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. 4(1), 1.","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” <i>ACM Transactions on Economics and Computation</i>, vol. 4, no. 1. Association for Computing Machinery, 2015.","ama":"Dütting P, Henzinger MH, Weber I. An expressive mechanism for auctions on the web. <i>ACM Transactions on Economics and Computation</i>. 2015;4(1). doi:<a href=\"https://doi.org/10.1145/2716312\">10.1145/2716312</a>","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2015). An expressive mechanism for auctions on the web. <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2716312\">https://doi.org/10.1145/2716312</a>","mla":"Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” <i>ACM Transactions on Economics and Computation</i>, vol. 4, no. 1, 1, Association for Computing Machinery, 2015, doi:<a href=\"https://doi.org/10.1145/2716312\">10.1145/2716312</a>."},"abstract":[{"lang":"eng","text":"Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. [2009] takes a first step toward addressing the problem of limited expressiveness by computing a bidder optimal, envy-free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piecewise linear utility functions with nonidentical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are nondegenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy-free outcomes for a general class of continuous utility functions via piecewise linear approximation. Finally, we prove hardness results for even more expressive settings."}],"publication_status":"published","_id":"11670","title":"An expressive mechanism for auctions on the web","publication":"ACM Transactions on Economics and Computation"},{"article_type":"original","publisher":"Elsevier","keyword":["Computer Science (miscellaneous)","Geotechnical Engineering and Engineering Geology","Atmospheric Science","Oceanography"],"date_published":"2010-05-12T00:00:00Z","issue":"3-4","page":"70-91","volume":34,"month":"05","date_created":"2021-02-15T14:40:19Z","status":"public","intvolume":"        34","publication_identifier":{"issn":["1463-5003"]},"oa_version":"None","type":"journal_article","date_updated":"2022-01-24T13:51:35Z","year":"2010","day":"12","citation":{"mla":"Canuto, V. M., et al. “Ocean Turbulence, III: New GISS Vertical Mixing Scheme.” <i>Ocean Modelling</i>, vol. 34, no. 3–4, Elsevier, 2010, pp. 70–91, doi:<a href=\"https://doi.org/10.1016/j.ocemod.2010.04.006\">10.1016/j.ocemod.2010.04.006</a>.","apa":"Canuto, V. M., Howard, A. M., Cheng, Y., Muller, C. J., Leboissetier, A., &#38; Jayne, S. R. (2010). Ocean turbulence, III: New GISS vertical mixing scheme. <i>Ocean Modelling</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ocemod.2010.04.006\">https://doi.org/10.1016/j.ocemod.2010.04.006</a>","ieee":"V. M. Canuto, A. M. Howard, Y. Cheng, C. J. Muller, A. Leboissetier, and S. R. Jayne, “Ocean turbulence, III: New GISS vertical mixing scheme,” <i>Ocean Modelling</i>, vol. 34, no. 3–4. Elsevier, pp. 70–91, 2010.","ama":"Canuto VM, Howard AM, Cheng Y, Muller CJ, Leboissetier A, Jayne SR. Ocean turbulence, III: New GISS vertical mixing scheme. <i>Ocean Modelling</i>. 2010;34(3-4):70-91. doi:<a href=\"https://doi.org/10.1016/j.ocemod.2010.04.006\">10.1016/j.ocemod.2010.04.006</a>","ista":"Canuto VM, Howard AM, Cheng Y, Muller CJ, Leboissetier A, Jayne SR. 2010. Ocean turbulence, III: New GISS vertical mixing scheme. Ocean Modelling. 34(3–4), 70–91.","short":"V.M. Canuto, A.M. Howard, Y. Cheng, C.J. Muller, A. Leboissetier, S.R. Jayne, Ocean Modelling 34 (2010) 70–91.","chicago":"Canuto, V.M., A.M. Howard, Y. Cheng, Caroline J Muller, A. Leboissetier, and S.R. Jayne. “Ocean Turbulence, III: New GISS Vertical Mixing Scheme.” <i>Ocean Modelling</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ocemod.2010.04.006\">https://doi.org/10.1016/j.ocemod.2010.04.006</a>."},"author":[{"full_name":"Canuto, V.M.","first_name":"V.M.","last_name":"Canuto"},{"full_name":"Howard, A.M.","first_name":"A.M.","last_name":"Howard"},{"first_name":"Y.","last_name":"Cheng","full_name":"Cheng, Y."},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","first_name":"Caroline J","last_name":"Muller"},{"full_name":"Leboissetier, A.","last_name":"Leboissetier","first_name":"A."},{"first_name":"S.R.","last_name":"Jayne","full_name":"Jayne, S.R."}],"article_processing_charge":"No","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","quality_controlled":"1","abstract":[{"text":"We have found a new way to express the solutions of the RSM (Reynolds Stress Model) equations that allows us to present the turbulent diffusivities for heat, salt and momentum in a way that is considerably simpler and thus easier to implement than in previous work. The RSM provides the dimensionless mixing efficiencies Γα (α stands for heat, salt and momentum). However, to compute the diffusivities, one needs additional information, specifically, the dissipation ε. Since a dynamic equation for the latter that includes the physical processes relevant to the ocean is still not available, one must resort to different sources of information outside the RSM to obtain a complete Mixing Scheme usable in OGCMs.\r\nAs for the RSM results, we show that the Γα’s are functions of both Ri and Rρ (Richardson number and density ratio representing double diffusion, DD); the Γα are different for heat, salt and momentum; in the case of heat, the traditional value Γh = 0.2 is valid only in the presence of strong shear (when DD is inoperative) while when shear subsides, NATRE data show that Γh can be three times as large, a result that we reproduce. The salt Γs is given in terms of Γh. The momentum Γm has thus far been guessed with different prescriptions while the RSM provides a well defined expression for Γm(Ri, Rρ). Having tested Γh, we then test the momentum Γm by showing that the turbulent Prandtl number Γm/Γh vs. Ri reproduces the available data quite well.\r\n\r\nAs for the dissipation ε, we use different representations, one for the mixed layer (ML), one for the thermocline and one for the ocean’s bottom. For the ML, we adopt a procedure analogous to the one successfully used in PB (planetary boundary layer) studies; for the thermocline, we employ an expression for the variable εN−2 from studies of the internal gravity waves spectra which includes a latitude dependence; for the ocean bottom, we adopt the enhanced bottom diffusivity expression used by previous authors but with a state of the art internal tidal energy formulation and replace the fixed Γα = 0.2 with the RSM result that brings into the problem the Ri, Rρ dependence of the Γα; the unresolved bottom drag, which has thus far been either ignored or modeled with heuristic relations, is modeled using a formalism we previously developed and tested in PBL studies.\r\nWe carried out several tests without an OGCM. Prandtl and flux Richardson numbers vs. Ri. The RSM model reproduces both types of data satisfactorily. DD and Mixing efficiency Γh(Ri, Rρ). The RSM model reproduces well the NATRE data. Bimodal ε-distribution. NATRE data show that ε(Ri < 1) ≈ 10ε(Ri > 1), which our model reproduces. Heat to salt flux ratio. In the Ri ≫ 1 regime, the RSM predictions reproduce the data satisfactorily. NATRE mass diffusivity. The z-profile of the mass diffusivity reproduces well the measurements at NATRE. The local form of the mixing scheme is algebraic with one cubic equation to solve.","lang":"eng"}],"publication_status":"published","title":"Ocean turbulence, III: New GISS vertical mixing scheme","publication":"Ocean Modelling","_id":"9145","language":[{"iso":"eng"}],"doi":"10.1016/j.ocemod.2010.04.006"}]